Conditional fault hamiltonian connectivity of the complete graph

DOI10.1016/J.IPL.2009.02.008MaRDI QIDQ987830zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Conditional fault Hamiltonicity of the complete graph
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• scientific article; zbMATH DE number 1246415
• On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance

Cites work

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

Cited in

(8)

• On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
• Strong matching preclusion of (n,k)-star graphs
• Conditional fault Hamiltonicity of the complete graph
• On the extremal number of edges in Hamiltonian connected graphs
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• A note on the strong matching preclusion problem for data center networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987830)