Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks

From Menger’s theorem, a graph is k-connected if and only if there are at least k-internally disjoint paths between any two distinct vertices. Therefore, the number of internally disjoint paths between two vertices may be larger than the connectivity. Motivated by this observation, Oh and Chen (resp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-04, Vol.259, p.145-152
Hauptverfasser:	Li, Pingshan, Xu, Min
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Connectivity Dimensional tolerances Fault tolerance Graph theory Hypercube-like networks Hypercubes Strong Menger edge connectivity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!