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

DOI10.1007/S10878-007-9113-1zbMath1175.05078OpenAlexW1992404721MaRDI QIDQ732323

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

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

hypercubefault toleranceHamiltonian cycleinterconnection network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges