Conditional fault hamiltonian connectivity of the complete graph

Information Processing Letters

Volumn 109, Issue 12, 2009, Pages 585-588

  Ho, Tung Yang ^a   Shih, Yuan Kang ^b   Tan, Jimmy J M ^b   Hsu, Lih Hsing ^c  

^a TA HWA INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Complete graph; Fault tolerance; Hamiltonian; Hamiltonian connected

Indexed keywords

FAULT TOLERANCE; HAMILTONIANS; MEATS; QUALITY ASSURANCE;

COMPLETE GRAPH; FAULT-TOLERANT; GRAPH G; HAMILTONIAN CONNECTED; HAMILTONIAN PATHS; MINIMUM DEGREES;

GRAPH THEORY;

EID: 62749202611     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.02.008     Document Type: Article

References (9)

1. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1980), North-Holland, New York
2. Chan M.Y., and Lee S.J. On the existence of Hamiltonian circuits in faulty hypercubes. SIAM Journal on Discrete Mathematics 4 (1991) 511-527
3. Fu J.S. Conditional fault hamiltonicity of the complete graph. Information Processing Letters 107 (2008) 110-113
4. Huang W.T., Tan J.J.M., Hung C.N., and Hsu L.H. Fault-tolerant hamiltonicity of twisted cubes. Journal of Parallel and Distributed Computing 62 (2002) 591-604
5. S. Latifi, S.Q. Zheng, N. Bagherzadeh, Optimal ring embedding in hypercubes with faulty links, in: Proceedings of the IEEE Symposium on Fault-Tolerant Computing, 1992, pp. 178-184
6. Li T.K., Tan J.J.M., and Hsu L.H. Hyper Hamiltonian laceability on the edge fault star graph. Information Sciences 165 (2004) 59-71
7. Moon J.W. On a problem of Ore. Math. Gaz. 49 (1965) 40-41
8. Ore O. Hamilton connected graphs. Journal of Mathematic Pures Application 42 (1963) 21-27
9. Ore O. Note on Hamilton circuits. The American Mathematical Monthly 67 (1960) 55