A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

DOI10.1007/s10878-007-9113-1zbMath1175.05078MaRDI QIDQ732323

Jimmy J. M. Tan, Lih-Hsing Hsu, Cheng-Kuan Lin, Tz-Liang Kueng, Tyne Liang

Publication date: 9 October 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9113-1

zbMATH Keywords

hypercube; fault tolerance; Hamiltonian cycle; interconnection network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C45: Eulerian and Hamiltonian graphs

Related Items

Structure connectivity and substructure connectivity of hypercubes, Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults, Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes, On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube, On the mutually independent Hamiltonian cycles in faulty hypercubes, Fault-free mutually independent Hamiltonian cycles of faulty star graphs

Cites Work

• The super laceability of the hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• A group-theoretic model for symmetric interconnection networks
• Unnamed Item
• Unnamed Item