Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs

A hamiltonian cycle C of a graph G is described as langu 1 , u 2 ,..., u n(G) , u 1 rang to emphasize the order of vertices in C. Thus, u 1 is the start vertex and u i is the i-th vertex in C. Two hamiltonian cycles of G start at a vertex x, C 1 = langu 1 , u 2 ,..., u n(G) , u 1 rang and C 2 = lang...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Cheng-Kuan Lin, Tan, J.J.M., Hua-Min Huang, Hsu, D.F., Lih-Hsing Hsu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer networks Computer science Concurrent computing Contracts Councils hamiltonian Information science Mathematics mutually independent hamiltonianicity pancake graph Parallel architectures star graph Tin
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!