Fault-tolerant Hamiltonian connectedness of cycle composition networks

DOI10.1016/j.amc.2007.05.055zbMath1221.94106OpenAlexW2051143524MaRDI QIDQ2474880

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

Publication date: 6 March 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.05.055

zbMATH Keywords

interconnection networkHamiltonian connectedcycle composition network

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (2)

A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube ⋮ The construction of mutually independent Hamiltonian cycles in bubble-sort graphs

Cites Work

• Unnamed Item
• Fault-tolerant Hamiltonicity of twisted cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Super-connectivity and super-edge-connectivity for some interconnection networks
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs

This page was built for publication: Fault-tolerant Hamiltonian connectedness of cycle composition networks