Abstract
The Pancake graph is node symmetric and useful interconnection network in the field of data sorting algorithm. The Half Pancake graph is a new interconnection network that reduces the degree of the Pancake graph by approximately half and improves the network cost of the Pancake graph. In this paper, we analyze topological properties of the Half Pancake graph . Fist, we prove that has maximally fault tolerance and recursive scalability. In addition, we show that in , there are isomorphic graphs of low-dimensional . Also, we propose that the Bubblesort can be embedded into Half Pancake with dilation 5, expansion 1. These results mean that various algorithms designed for the Pancake graph and the Bubble sort graph can be executed on efficiently.
Published Version (
Free)
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