정보처리학회논문지A (The KIPS Transactions:PartA)

한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

에지 고장이 있는 Restricted Hypercube-Like 그래프의 해밀톤 경로

Hamiltonian Paths in Restricted Hypercube-Like Graphs with Edge Faults

  • 김숙연 (한경대학교 컴퓨터공학과) ;
  • 전병태 (한경대학교 웹정보공학과)
  • 투고 : 2011.06.03
  • 심사 : 2011.09.13
  • 발행 : 2011.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Restricted Hypercube-Like(RHL) 그래프는 교차큐브, 뫼비우스큐브, 엠큐브, 꼬인큐브, 지역꼬인큐브, 다중꼬인큐브, 일반꼬인큐브와 같이 유용한 상호연결망들을 광범위하게 포함하는 그래프군이다. 본 논문에서는 $m{\geq}4$ 인 m-차원 RHL 그래프 G에 대해서 임의의 에지 집합 $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, 가 고장일 때, 고장 에지들을 제거한 그래프 $G{\setminus}F$는 임의의 서로 다른 두 정점 s와 t에 대해서 dist(s, V(F))${\neq}1$ 이거나 dist(t, V(F))${\neq}1$이면 해밀톤 경로가 있음을 보인다. V(F)는 F에 속하는 에지들의 양 끝점들의 집합이고 dist(v, V(F))는 정점 v와 집합 V(F)의 정점들 간의 최소 거리이다.

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

키워드

참고문헌

  1. J.-H. Park, H.-C. Kim, and H.-S. Lim, "Fault-hamiltonicity of hypercube-like interconnection networks," in Proc. of IEEE International Parallel & Distributed Processing Symposium IPDPS2005, Denver, Colorado, Apr., 2005. https://doi.org/10.1109/IPDPS.2005.223
  2. A. S. Vaidya, P. S. N. Rao, and S. R. Shankar, "A class of hypercube-like networks," in Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing SPDP 1993, pp.800-803, 1993. https://doi.org/10.1109/SPDP.1993.395450
  3. K. Efe, "The crossed cube architecture for parallel computation," IEEE Trans. on Parallel and Distributed Systems, 3(5), pp.513-524, 1992. https://doi.org/10.1109/71.159036
  4. P. Cull and S. M. Larson, "The Möbius cubes," IEEE Transactions on Computers, 44(5), pp.647-659, 1995. https://doi.org/10.1109/12.381950
  5. N. K. Singhvi and K. Ghose, "The Mcube: a symmetrical cube based network with twisted links," in Proc. of the 9th IEEE Int. Parallel Processing Symposium IPPS 1995, pp.11-16, 1995. https://doi.org/10.1109/IPPS.1995.395907
  6. P. A. J. Hilbers, M. R. J. Koopman, and J. L. A. van de Snepscheut, "The Twisted Cube," in J. Bakker, A. Nijman, P. Treleaven, eds., PARLE: Parallel Architectures and Languages Europe, Vol. I: Parallel Architectures, pp.152-159, Springer, 1987.
  7. X. Yang, D. J. Evans, and G. M. Megson, "The locally twisted cubes," International Journal of Computer Mathematics, 82(4), pp.401-413, 2005. https://doi.org/10.1080/0020716042000301752
  8. K. Efe, "A variation on the hypercube with lower diameter," IEEE Trans. on Computers, 40(11), pp.1312-1316, 1991. https://doi.org/10.1109/12.102840
  9. F. B. Chedid and R. B. Chedid, A new variation on hypercubes with smaller diameter," Information Processing Letters, 46(6), pp.275-280, 1993, https://doi.org/10.1016/0020-0190(93)90065-H
  10. J.-H. Park and K.-Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theoretical Computer Science, 244(1-2), pp.35-62, 2000. https://doi.org/10.1016/S0304-3975(00)00176-6
  11. X. Yang, Q. Dong, E. Yang, and J. Cao, "Hamiltonian properties of twisted hypercube-like networks with more faulty elements," Theoretical Computer Science, 412(22), pp.2409-2417, 2011. https://doi.org/10.1016/j.tcs.2011.01.034
  12. S. Wang and S. Zhang, "Embedding hamiltonian paths in k -ary n-cubes with conditional edge faults," Theoretical Computer Science, 412(46), pp.6570-6584, 2011. https://doi.org/10.1016/j.tcs.2011.02.030
  13. T. Kueng, T. Liang, L.-H.Hsu and J. J. M. Tan, "Long paths in hypercubes with conditional node-faults," Information Sciences, 179(5), pp.667-681, 2009. https://doi.org/10.1016/j.ins.2008.10.015
  14. J.-H. Park, H.-S. Lim, and H.-C. Kim, "Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements," Theoretical Computer Science, 377(1-3), pp.170-180, 2007. https://doi.org/10.1016/j.tcs.2007.02.029
  15. S. Y. Hsieh and C. W. Lee, "Pancyclicity of restricted hypercube-like networks under the conditional fault model," SIAM Journal on Discrete Mathematics, 23(4), pp.2100- 2119, 2010. https://doi.org/10.1137/090753747
  16. N. Biggs, Algebraic Graph Theory, 2rid ed., Cambridge Univ. Press, Cambridge, 1993.
  17. J.-H. Park, H.-C. Kim, and H.-S. Lim, "Many-to-many disjoint path covers in the presence of faulty elements," IEEE Trans. Computers, 58(4), pp.528-540, 2009. https://doi.org/10.1109/TC.2008.160