Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

DOI10.1080/00207160701684485zbMath1158.68432OpenAlexW2106831697MaRDI QIDQ3603584

Jimmy J. M. Tan, Cheng-Kuan Lin, Lih-Hsing Hsu, Tung-Yang Ho

Publication date: 18 February 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701684485

zbMATH Keywords

HamiltonianHamiltonian connectedfolded Petersen cube networks

Mathematics Subject Classification ID

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

Related Items (2)

On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization ⋮ Matching preclusion and conditional matching preclusion problems for the folded Petersen cube

Cites Work

• Unnamed Item
• Unnamed Item
• Fault-tolerant Hamiltonicity of twisted cubes
• Ring embedding in faulty pancake graphs
• On some super fault-tolerant Hamiltonian graphs
• A delay optimal coterie on the \(k\)-dimensional folded Petersen graph
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs

This page was built for publication: Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks