Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Fault-hamiltonicity of Bipartite Double Loop Networks

이분 그래프인 이중 루프 네트워크의 고장 해밀톤 성질

  • 박정흠 (가톨릭대학교 컴퓨터정보공학부)
  • Published : 2004.02.01
Download PDF
⟨ Previous Next ⟩

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.

이 논문에서는 정점이나 에지 고장이 있는 이중 루프 네트워크에서 임의의 두 정점을 연결하는 고장 없는 최장 경로를 고찰하여, 고장인 요소의 수가 둘 흑은 그 이하인 경우 이분 그래프인 이중 루프 네트워크 G(mn；1, m)은 강한 해밀톤 laceable 그래프임을 보인다. G(mn；1, m)은 m이 홀수이고 n이 짝수일 경우에만 이분 그래프이다.

Keywords

References

  1. A. Sengupta. 'On ring embedding in hypercubes with faulty nodes and links,' Inform. Proc. Lett. 68, pp. 207-214, 1998 https://doi.org/10.1016/S0020-0190(98)00159-8
  2. 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 https://doi.org/10.1016/S0020-0190(98)00066-0
  3. 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 https://doi.org/10.1109/71.640010
  4. 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 https://doi.org/10.1016/S0020-0190(99)00072-1
  5. D.J. Guan, 'An optimal message routing algorithm for double-loop networks,' Inform. Proc. Lett. 65(5), pp. 255-260, 1998 https://doi.org/10.1016/S0020-0190(98)00013-1
  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 https://doi.org/10.1016/0012-365X(95)00072-5
  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. 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
  10. 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