On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube

DOI10.1007/s10878-012-9528-1zbMath1319.90074OpenAlexW2022422572MaRDI QIDQ2444140

Cheng-Kuan Lin, Tzu-Liang Kung, Lih-Hsing Hsu

Publication date: 8 April 2014

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9528-1

zbMATH Keywords

hypercubegraphfault toleranceHamiltonian cycleinterconnection network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Structure connectivity and substructure connectivity of hypercubes ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mutually independent Hamiltonian cycles in \(k\)-ary \(n\)-cubes when \(k\) is even
• Computational complexity of long paths and cycles in faulty hypercubes
• Long paths in hypercubes with a quadratic number of faults
• A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• The super laceability of the hypercubes
• On the bipanpositionable bipanconnectedness of hypercubes
• Limit distribution laws of estimates constructed from censored samples
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Long cycles in hypercubes with optimal number of faulty vertices
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
• A group-theoretic model for symmetric interconnection networks
• Distributed fault-tolerant ring embedding and reconfiguration in hypercubes
• Optimum broadcasting and personalized communication in hypercubes
• Embedded paths and cycles in faulty hypercubes

This page was built for publication: On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube