Optimal Routing and Hamiltonian Cycle in Petersen-Torus Networks

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.

[1]  A. K. Banerjee,et al.  Hyper Petersen network: yet another hypercube-like topology , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[2]  E. Bannai,et al.  On finite Moore graphs , 1973 .

[3]  Lei Wang,et al.  Research on Petersen Graphs and Hyper-cubes Connected Interconnection Networks , 2006, Asia-Pacific Computer Systems Architecture Conference.

[4]  Gary Chartrand,et al.  The ubiquitous Petersen graph , 1992, Discret. Math..

[5]  Derek Allan Holton,et al.  The Petersen graph , 1993, Australian mathematical society lecture series.

[6]  Sajal K. Das,et al.  Folded Petersen cube networks: new competitors for the hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.