Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2002.07c
- /
- Pages.2079-2082
- /
- 2002
Hamiltonian Connectedness of Mesh Networks with Two Wraparound Edges
- Park, Kyoung-Wook (Department of Computer Science, Chonnam National University) ;
- Lee, Hyeong-Ok (Department of Computer Education, Sunchon National University) ;
- Kang, Seung-Ho (Department of Computer Science, Chonnam National University) ;
- Lim, Hyeong-Seok (Department of Computer Science, Chonnam National University)
- Published : 2002.07.01
Abstract
An interconnection network is called hamiltonian-connected if there exists a hamiltonian path joining every pair of nodes. We consider the problem of adding edges to a mesh to make it hamiltonian- connected. We show that at least two edges are necessary for the problem. Also, we present the method to add two edges to a mesh so that the resulting network is hamiltonian-connected.
Keywords