Optimal Routing and Hamiltonian Cycle in Petersen-Torus Networks
Jung-Hyun Seo, Lee HyeongOk, Moonsuk Jang · 2008
In this paper, we develop optimal routing algorithm and Hamiltonian cycle in Petersen-Torus network based on well-known Petersen graph. PT(m,n) is a regular graph where the number of nodes is 10 mn, the number of edges 20 mn and degree 4. Hamiltoinan cycle is made by using Hamiltonian path in Petersen graph. Optimal routing algorithm is made by using PT's diameter edge and node pairs.