The girths of the cubic Pancake graphs
Elena V. Konstantinova, Son En Gun

TL;DR
This paper investigates the girth of cubic Pancake graphs, which are specific Cayley graphs generated by prefix-reversals, and establishes an upper bound of twelve for their girth.
Contribution
The paper provides the first analysis of the girth of cubic Pancake graphs, showing they have girths at most twelve, advancing understanding of their structural properties.
Findings
Cubic Pancake graphs have girth at most twelve.
Six generating sets of prefix-reversals produce connected Cayley graphs.
The girth bounds contribute to the structural characterization of these graphs.
Abstract
The Pancake graphs , are Cayley graphs over the symmetric group generated by prefix-reversals. There are six generating sets of prefix-reversals of cardinality three which give connected Cayley graphs over the symmetric group known as cubic Pancake graphs. In this paper we study the girth of the cubic Pancake graphs. It is proved that considered cubic Pancake graphs have the girths at most twelve.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
