하프팬케익 그래프의 다양한 성질 분석

서정현, 이형옥 · 2014

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 HP n . Fist, we prove that HP n has maximally fault tolerance and recursive scalability. In addition, we show that in HP n , there are isomorphic graphs of low-dimensional HP n . Also, we propose that the Bubblesort Bn can be embedded into Half Pancake HP n 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 HP n efficiently.

Cited by 6 works.

Authors