Fault hamiltonicity of meshes with two wraparound edges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 412-421

  Park, Kyoung Wook ^a   Lim, Hyeong Seok ^a   Park, Jung Heum ^b   Kim, Hee Chul ^c  

^a Chonnam National University   (South Korea)

^b The Catholic University of Korea   (South Korea)

^c Hankuk University of Foreign Studies   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FAULT-HAMILTONICITY; FAULTY ELEMENTS; FAULTY VERTICES; HAMILTONIAN CONNECTED; HAMILTONIAN LACEABLE; N-DIMENSIONAL HYPERCUBE; SUBGRAPHS;

HAMILTONIANS;

EID: 35048847616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_44     Document Type: Article

References (11)

1. C.-H. Tsai, J. M. Tan, Y. C. Chuang and L.-H. Hsu, Fault-free cycles and links in faulty recursive circulant graphs, Proceedings of the 2000 International Computer Symposium: Workshop on Computer Algorithms and Theory of Computation (2000) 74-77.
2. J.-H. Park and H.-C. Kim, Fault hamiltonicity of product graph of path and cycle, International Computing and Combinatorics Conference(COCOON) (2003) 319-328.
3. G. Simmons, Almost all n-dimensional rectangular lattices are Hamilton laceable, Congressus Numerantium 21 (1978) 103-108.
4. S. Y. Hsieh, G. H. Chen and C. W. Ho, Hamiltonian-laceability of star graphs, Networks 36 (2000) 225-232.
5. A. Itai, C. H. Papadimitriou and J. L. Czwarcfiter, Hamiltonian paths in grid graphs. SIAM Journal of Computing 11 (4) (1982) 676-686.
6. S. D. Chen, H. Shen and R. W. Topor, An efficient algorithm for constructing hamiltonian paths in meshes, Parallel Computing 28 (2002) 1293-1305.
7. J. S. Kim, S. R. Maeng and H. Yoon, Embedding of rings in 2-D meshes and tori with faulty nodes, Journal of Systems Architecture 43 (1997) 643-654.
8. M. Lewinter and W. Widulski, Hyper-hamilton laceable and caterpillar-spannable product graphs, Computer Math. Applic. 34 (11) (1997) 99-104.
9. C.-H. Tsai, J. M. Tan, T. Lian and L.-H. Hsu, Fault-tolerant hamiltonian laceability of hypercubes, Information Processing Letters 83 (2002) 301-306.
10. C. C. Chen and N. F. Quimpo, On strongly Hamiltonian abelian group graphs. Combinatorial Mathematics VIII. Lecture Notes in Mathematics 884 (1980) 23-34.
11. S. Latifi, S. Zheng, N. Bagherzadeh, Optimal ring embedding in hypercubes with faulty links, International Symposium on Fault-Tolerant Computing(FTCS) (1992) 178-184.