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