The super spanning connectivity and super spanning laceability of the enhanced hypercubes

A k -container C ( u , v ) of a graph G is a set of k disjoint paths between u and v . A k -container C ( u , v ) of G is a k * -container if it contains all vertices of G . A graph G is k * -connected if there exists a k * -container between any two distinct vertices of G . Therefore, a graph is 1...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of supercomputing 2009-04, Vol.48 (1), p.66-87
Hauptverfasser:	Chang, Chung-Hao, Lin, Cheng-Kuan, Tan, Jimmy J. M., Huang, Hua-Min, Hsu, Lih-Hsing
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Compilers Computer Science Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Graphs Hypercubes Integers Interpreters Processor Architectures Programming Languages Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!