Browse > Article

Fault-hamiltonicity of Bipartite Double Loop Networks  

박정흠 (가톨릭대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.1_2, 2004 , pp. 19-26 More about this Journal
Abstract
In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.
Keywords
Hamiltonian-laceable; fault tolerance; interconnection networks; longest paths; circulant graphs;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C.-y. Chou, D.J. Guan, and K.-1. Wang, 'A dynamic fault-tolerant message routing algorithm for double-loop networks,' Inform. Proc. Lett. 70(6), pp. 259-264, 1999   DOI   ScienceOn
2 A. Sengupta. 'On ring embedding in hypercubes with faulty nodes and links,' Inform. Proc. Lett. 68, pp. 207-214, 1998   DOI   ScienceOn
3 T.-Y. Sung, C.-Y. Lin, Y.-C. Chuang, and L.-H. Hsu, 'Fault tolerant token ring embedding in double loop networks,' Inform. Proc. Lett. 66, pp. 201-207, 1998   DOI   ScienceOn
4 J.-H. Park and H.-C. Kim, 'Fault-hamiltonicity of product graph of path and cycle,' in Proc. of International Computing and Combinatorics Conference COCOON2003(LNCS #2697), MT, USA, pp. 319-328, 2003
5 D.J. Guan, 'An optimal message routing algorithm for double-loop networks,' Inform. Proc. Lett. 65(5), pp. 255-260, 1998   DOI   ScienceOn
6 S.J. Curran and J.A. Gallian, 'Hamiltonian cycles and paths in Cayley graphs and digraphs - a survey,' Discrete Mathematics 156, pp. 1-18, 1996   DOI   ScienceOn
7 J.-H. Park and H.-C. Kim, 'Fault hamiltonicity of double loop networks G(mn;1, m) with even m and n,' Journal of KISS 27(10), pp. 868-879, 2000
8 C.-H. Tsai, J.J.M. Tan, Y.-C. Chuang, and L.-H. Hsu, 'Fault-free cycles and links in faulty recursive circulant graphs,' in Proc. of Workshop on Algorithms and Theory of Computation ISC2000, pp. 74-77, 2000
9 Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu, 'Fault-tolerant ring embedding in a star graph with both link and node failures,' IEEE Trans. Parallel and Distributed Systems 8(12), pp. 1185-1195, Dec. 1997   DOI   ScienceOn
10 C.C. Chen and N.F. Quimpo, 'On strongly hamiltonian abelian group graphs,' in. Australian Conference on Combinatorial Mathematics(Lecture Notes in Mathematics #884), pp. 23-34, 1980