Conditional fault hamiltonian connectivity of the complete graph

DOI10.1016/j.ipl.2009.02.008zbMath1209.68054OpenAlexW2070086094MaRDI QIDQ987830

Jimmy J. M. Tan, Yuan-Kang Shih, Lih-Hsing Hsu, Tung-Yang Ho

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.008

zbMATH Keywords

fault tolerancecomplete graphhamiltonianhamiltonian connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ On the extremal number of edges in Hamiltonian connected graphs

Cites Work

• Unnamed Item
• Fault-tolerant Hamiltonicity of twisted cubes
• Hyper Hamiltonian laceability on edge fault star graph
• Hamilton connected graphs
• Conditional fault Hamiltonicity of the complete graph
• Note on Hamilton Circuits
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• On a Problem of Ore

This page was built for publication: Conditional fault hamiltonian connectivity of the complete graph