pith. sign in

arxiv: 1201.0452 · v1 · pith:PGLEGKIWnew · submitted 2012-01-02 · 🧮 math.CO

Automorphism Groups of the Pancake Graphs

classification 🧮 math.CO
keywords pancakegraphsautomorphismakerscitecompletelydenoteddetermine
0
0 comments X
read the original abstract

It is well-known that the pancake graphs are widely used as models for interconnection networks \cite{Akers}. In this paper, some properties of the pancake graphs are investigated. We first prove that the pancake graph, denoted by $P_n (n\geq 4),$ is super-connected and hyper-connected. Further, we study the symmetry of $P_n$ and completely determine its full automorphism group,which shows that $P_n (n\geq 5)$ is a graphical regular representation of $S_n.$

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.