Abstract
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. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Konstantinova, E. (2013). On some structural properties of star and pancake graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 472–487). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
