The construction of mutually independent Hamiltonian cycles in bubble-sort graphs

DOI10.1080/00207160802512700zbMath1198.05109OpenAlexW1978890023MaRDI QIDQ3056358

D. Frank Hsu, Jimmy J. M. Tan, Cheng-Kuan Lin, Yuan-Kang Shih, Lih-Hsing Hsu

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802512700

zbMATH Keywords

Cayley graphHamiltonian cycleinterconnection networksmutually independent Hamiltonian cyclesbubble-sort networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ A note on Hamiltonian decomposition of Bubble-Sort graphs

Cites Work

• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Fault-tolerant Hamiltonian connectedness of cycle composition networks
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Ringing the Cosets

This page was built for publication: The construction of mutually independent Hamiltonian cycles in bubble-sort graphs