Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs

DOI10.1016/j.mcm.2008.08.014zbMath1187.68349MaRDI QIDQ2389847

Tyne Liang, Tz-Liang Kueng, Lih-Hsing Hsu

Publication date: 19 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.08.014

zbMATH Keywords

graph; Hamiltonian cycle; interconnection network; butterfly graph

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C45: Eulerian and Hamiltonian graphs

Related Items

Rooted level-disjoint partitions of Cartesian products, Modelling simultaneous broadcasting by level-disjoint partitions, On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube, \(T\)-coloring of certain networks, Fault-free mutually independent Hamiltonian cycles of faulty star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Hamilton circuits in the directed wrapped Butterfly network
• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Cycle embedding in faulty wrapped butterfly graphs
• Hamilton cycles and paths in butterfly graphs
• Cycles in butterfly graphs
• Viceroy
• Embedding complete binary trees into butterfly networks
• Optimum broadcasting and personalized communication in hypercubes