Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call