A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the embedding of cycles in pancake graphs
Parallel Computing
On the diameter of the pancake network
Journal of Algorithms
Efficient dominating sets in Cayley graphs
Discrete Applied Mathematics
On average and highest number of flips in pancake sorting
Theoretical Computer Science
Computing the diameter of 17-pancake graph using a PC cluster
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.00 |
In this paper we give a report on some results for the Star and Pancake graphs obtained after the conference "Search Methodologies" which was held in October, 2010. The graphs are defined as Cayley graphs on the symmetric group with the generating sets of all prefix---transpositions and prefix---reversals, correspondingly. They are also known as the Star and Pancake networks in computer science. In this paper we give the full characterization of perfect codes for these graphs. We also investigate a cycle structure of the Pancake graph and present an explicit description of small cycles as well as their number in the graph.