Conditional fault Hamiltonicity of the complete graph
References (13)
- et al.
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
(1992) - et al.
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences
(2007) Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges
Parallel Computing
(2006)- et al.
Fault-tolerant embedding of Hamiltonian circuits in k-ary n-cube
SIAM Journal on Discrete Mathematics
(2002) - et al.
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
(1991) - et al.
The ()-star graph: a generalized star graph
Information Processing Letters
(1995)
There are more references available in the full text version of this article.
Cited by (12)
Integer k-matching preclusion of twisted cubes and (n,s)-star graphs
2023, Applied Mathematics and ComputationA note on the strong matching preclusion problem for data center networks
2020, Information Processing LettersConditional edge-fault-tolerant Hamiltonicity of the data center network
2018, Discrete Applied MathematicsStrong matching preclusion of (n,k)-star graphs
2016, Theoretical Computer ScienceEdge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
2013, Information SciencesOn the extremal number of edges in hamiltonian connected graphs
2010, Applied Mathematics LettersCitation Excerpt :With the inspiration of the work by Fu [7] in the study of 2-conditional edge-fault tolerant hamiltonicity of the complete graph, Ho et al. [12] begin the study on 3-conditional edge-fault tolerant hamiltonian connectivity of the complete graph.
Copyright © 2008 Elsevier B.V. All rights reserved.