Conditional fault Hamiltonicity of the complete graph

DOI10.1016/j.ipl.2008.02.001zbMath1185.05094OpenAlexW2139655372MaRDI QIDQ963413

Jung-Sheng Fu

Publication date: 19 April 2010

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

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

zbMATH Keywords

hypercubeHamiltonian cycleinterconnection networkscomplete graphfault-tolerant embeddingconditional edge fault

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Conditional edge-fault-tolerant Hamiltonicity of the data center network ⋮ 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 ⋮ Conditional fault hamiltonian connectivity of the complete graph ⋮ On the extremal number of edges in Hamiltonian connected graphs ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

Cites Work

• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Arrangement graphs: A class of generalized star graphs
• The \((n,k)\)-star graph: A generalized star graph
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems