Generalised Pancake Graphs

• Generalised pancake graphs are Cayley graphs built on the wreath product ℤₘ wr Sₙ, where vertices represent colored permutations updated via prefix reversals.
• They feature a recursive structure with non-overlapping copies of smaller graphs, enabling inductive proofs for cycle lengths, Hamiltonicity, and fault tolerance.
• Recent research uncovers detailed cycle spectra, spectral gaps via equitable partitions, and topological embeddings that inform their application in interconnection networks.

Generalised pancake graphs are Cayley graphs of the generalized symmetric group $S(m,n)=C_m\wr S_n$, equivalently $\mathbb{Z}_m\wr S_n$, generated by prefix reversals. In the cited literature this family appears as both $\mathcal{P}_m(n)$ and $\mathbb{P}_m(n)$. Its vertices are colored permutations, its order is $m^n n!$, and its two most studied special cases are the classical pancake graph at $m=1$ and the burnt pancake graph at $m=2$. Recent work has developed a comparatively coherent theory of these graphs in four directions: recursive combinatorial structure, cycle and Hamiltonian phenomena, spectral analysis via equitable partitions, and topological embeddings via rotation systems (Blanco et al., 2022, Greaves et al., 11 Sep 2025, Blanco et al., 2023).

1. Algebraic construction and notation

The generalised pancake graph is defined on the wreath product $S(m,n)=\mathbb{Z}_m\wr S_n$, whose elements are viewed as colored permutations. Two vertices are adjacent when one is obtained from the other by a prefix reversal of the first $k$ entries, with a possible color change by $+1$ or $\mathbb{Z}_m\wr S_n$0 on the entries that are flipped. For $\mathbb{Z}_m\wr S_n$1 this recovers the classical pancake graph, and for $\mathbb{Z}_m\wr S_n$2 it gives the burnt pancake graph, where reversing a prefix also changes the sign of every involved entry. For $\mathbb{Z}_m\wr S_n$3, each prefix length yields two types of flips, usually described as positive and negative color flips (Greaves et al., 11 Sep 2025).

In the undirected formulation, the graph is the Cayley graph of $\mathbb{Z}_m\wr S_n$4 generated by prefix reversals and their inverses, sometimes called flips and flops. The resulting graph is vertex-transitive. The 2022 cycle paper further records that it is not edge-transitive in general, although the set of edges with the same label is edge-transitive. A complementary group-theoretic viewpoint treats prefix reversals as generators of $\mathbb{Z}_m\wr S_n$5 and $\mathbb{Z}_m\wr S_n$6, and relates the orders of products of generators to cycle lengths in the corresponding Cayley graphs (Blanco et al., 2022, Blanco et al., 2018).

2. Recursive architecture

A central structural fact is that $\mathbb{Z}_m\wr S_n$7 contains $\mathbb{Z}_m\wr S_n$8 non-overlapping copies of $\mathbb{Z}_m\wr S_n$9, obtained by fixing the last signed-symbol. This hierarchical decomposition underlies most known inductive proofs on cycle lengths, genus bounds, and fault-tolerant path constructions. The same paper also exhibits an explicit base cycle of length $\mathcal{P}_m(n)$0, obtained by successively applying flop-flip combinations across these layers (Blanco et al., 2022).

For the burnt special case $\mathcal{P}_m(n)$1, the decomposition becomes especially rigid: $\mathcal{P}_m(n)$2 can be partitioned into $\mathcal{P}_m(n)$3 induced subgraphs $\mathcal{P}_m(n)$4, each isomorphic to $\mathcal{P}_m(n)$5, by fixing the last symbol together with its sign. In the cycle literature, edges labeled $\mathcal{P}_m(n)$6 connect these copies; in the connectivity literature, the same partition is described as a cluster structure. The data further records that each vertex has exactly one out-neighbour in another cluster, and that edges between two distinct clusters form a matching. These properties are repeatedly exploited in inductive constructions of Hamiltonian paths, disjoint path covers, and internally edge-disjoint Steiner trees (Blanco et al., 2018, Wang et al., 2022, Dvořák et al., 2023).

This recursive architecture has methodological consequences. It enables arguments that build global objects by first constructing cycles, paths, or trees inside copies of $\mathcal{P}_m(n)$7 or $\mathcal{P}_m(n)$8, and then patching them through controlled inter-copy edges. A plausible implication is that recursive decomposition, rather than representation theory, is the dominant structural mechanism currently available for this family.

3. Cycle structure, girth, and Hamiltonicity

For $\mathcal{P}_m(n)$9, the girth of the undirected generalized pancake graph is

$\mathbb{P}_m(n)$0

This complements the known special cases $\mathbb{P}_m(n)$1 and $\mathbb{P}_m(n)$2. The parity of $\mathbb{P}_m(n)$3 determines the global cycle spectrum. If $\mathbb{P}_m(n)$4 is odd, then $\mathbb{P}_m(n)$5 is $\mathbb{P}_m(n)$6-pancyclic, where $\mathbb{P}_m(n)$7: it contains cycles of every length from $\mathbb{P}_m(n)$8 up to $\mathbb{P}_m(n)$9. If $m^n n!$0 is even, then $m^n n!$1 is $m^n n!$2-panevencyclic: it contains all even cycle lengths from its girth to a Hamiltonian cycle. The base cases are explicit: $m^n n!$3 has all cycle lengths, while $m^n n!$4 has all even cycle lengths (Blanco et al., 2022).

Regime	Girth	Guaranteed cycle lengths
$m^n n!$5	$m^n n!$6	every $m^n n!$7 with $m^n n!$8
$m^n n!$9	$m=1$0	every $m=1$1 with $m=1$2
$m=1$3	$m=1$4	every even $m=1$5 with $m=1$6
odd $m=1$7	$m=1$8	every length from girth to $m=1$9
even $m=2$0	$m=2$1	every even length from girth to a Hamiltonian cycle

The proof strategy in the general case is inductive. Cycles inside copies of $m=2$2 are merged through the base cycle, with resulting lengths of the form

$m=2$3

This formula is used to cover the required interval of admissible lengths (Blanco et al., 2022).

The burnt pancake graph is especially well understood. It is Hamiltonian and weakly pancyclic: for $m=2$4, $m=2$5 contains a cycle of every length $m=2$6 with $m=2$7. Its girth is $m=2$8, and the 8-cycles admit a complete classification. Every 8-cycle in $m=2$9 has one of the canonical forms

$S(m,n)=\mathbb{Z}_m\wr S_n$0

with the parameter restrictions stated in Theorem 4.1 of the paper. The proof is constructive and relies on the recursive structure of $S(m,n)=\mathbb{Z}_m\wr S_n$1 (Blanco et al., 2018).

4. Spectral properties

The recent spectral theory of generalized pancake graphs is centered on equitable partitions and quotient matrices. For a graph with eigenvalues $S(m,n)=\mathbb{Z}_m\wr S_n$2, the spectral gap is $S(m,n)=\mathbb{Z}_m\wr S_n$3; in regular graphs, $S(m,n)=\mathbb{Z}_m\wr S_n$4 equals the degree. The 2025 note proves that

$S(m,n)=\mathbb{Z}_m\wr S_n$5

so the burnt pancake graph has spectral gap strictly less than $S(m,n)=\mathbb{Z}_m\wr S_n$6, while the generalised pancake graphs with $S(m,n)=\mathbb{Z}_m\wr S_n$7 have spectral gap strictly less than $S(m,n)=\mathbb{Z}_m\wr S_n$8. The same paper also establishes multiplicity lower bounds for integer eigenvalues when $S(m,n)=\mathbb{Z}_m\wr S_n$9: $k$0 These results settle two conjectures of Blanco and Buehrle (Greaves et al., 11 Sep 2025).

The quotient spectra are explicit. For $k$1,

$k$2

and for $k$3,

$k$4

where $k$5 is diagonal and $k$6 is an upper-triangular $k$7-$k$8 matrix. The proofs combine equitable partitions, quotient-matrix computations, eigenvalue interlacing, and the divisibility of characteristic polynomials. The same paper explicitly notes why this route is needed: although $k$9 are Cayley graphs, their generating sets are not conjugation-closed, so classical group-character techniques do not apply (Greaves et al., 11 Sep 2025).

For the burnt pancake graph alone, an earlier result proves that the adjacency spectrum contains every integer in

$+1$0

That work constructs a $+1$1 quotient matrix

$+1$2

and also shows that the eigenvalue $+1$3 has multiplicity at least $+1$4 (Blanco et al., 2024).

5. Genus and 2-cell embeddings

The topological theory of generalized pancake graphs is comparatively recent. For the undirected generalized pancake graph $+1$5, the first general upper and lower bounds for the orientable genus $+1$6 were proved constructively in 2023. For $+1$7 and $+1$8, the lower bounds are

$+1$9

while the upper bounds are

$\mathbb{Z}_m\wr S_n$00

These estimates are asymptotically tight, and in particular

$\mathbb{Z}_m\wr S_n$01

The paper also records the example $\mathbb{Z}_m\wr S_n$02, so $\mathbb{Z}_m\wr S_n$03 is toroidal and not planar (Blanco et al., 2023).

For $\mathbb{Z}_m\wr S_n$04, sharper explicit bounds are given. If $\mathbb{Z}_m\wr S_n$05 is odd and $\mathbb{Z}_m\wr S_n$06, then

$\mathbb{Z}_m\wr S_n$07

whereas if $\mathbb{Z}_m\wr S_n$08 is odd and $\mathbb{Z}_m\wr S_n$09, then

$\mathbb{Z}_m\wr S_n$10

If $\mathbb{Z}_m\wr S_n$11 is even and $\mathbb{Z}_m\wr S_n$12, then

$\mathbb{Z}_m\wr S_n$13

and if $\mathbb{Z}_m\wr S_n$14 is even and $\mathbb{Z}_m\wr S_n$15, then

$\mathbb{Z}_m\wr S_n$16

(Blanco et al., 2023).

The proofs use rotation systems, or Edmonds' permutation technique, together with custom vertex-labeling algorithms ALCYC and ALGRA. For $\mathbb{Z}_m\wr S_n$17, prefix reversals are not involutions, unlike the cases $\mathbb{Z}_m\wr S_n$18. The construction arranges incident edges at each vertex so that certain cycles become facial boundaries in a 2-cell embedding, and repeated application of a generator $\mathbb{Z}_m\wr S_n$19 yields a face whose length is the order $\mathbb{Z}_m\wr S_n$20 (Blanco et al., 2023).

6. Connectivity, fault tolerance, and related directions

The strongest reliability results in the supplied literature concern the burnt special case $\mathbb{Z}_m\wr S_n$21. Its generalized 3-connectivity and generalized 4-connectivity are both exactly $\mathbb{Z}_m\wr S_n$22: $\mathbb{Z}_m\wr S_n$23 Thus, for any three vertices, or any four vertices, there exist $\mathbb{Z}_m\wr S_n$24 internally edge-disjoint trees connecting them. The proofs rely on the cluster decomposition into $\mathbb{Z}_m\wr S_n$25 copies of $\mathbb{Z}_m\wr S_n$26, fan arguments, out-neighbour control, and case analyses according to the distribution of the terminals among clusters (Wang et al., 2022, Wang et al., 2023).

Fault-tolerant Hamiltonian and path-cover properties are also known. If $\mathbb{Z}_m\wr S_n$27 and $\mathbb{Z}_m\wr S_n$28 has at most $\mathbb{Z}_m\wr S_n$29 faulty elements, then for any two terminal pairs $\mathbb{Z}_m\wr S_n$30 and $\mathbb{Z}_m\wr S_n$31 there exist two vertex-disjoint paths $\mathbb{Z}_m\wr S_n$32 and $\mathbb{Z}_m\wr S_n$33 whose vertices partition $\mathbb{Z}_m\wr S_n$34; for every $\mathbb{Z}_m\wr S_n$35, there is a set of $\mathbb{Z}_m\wr S_n$36 faulty edges or faulty vertices for which such a paired 2-disjoint path cover does not exist. Under a hybrid model combining faulty edges with removals of both end-vertices of matching edges, $\mathbb{Z}_m\wr S_n$37 is $\mathbb{Z}_m\wr S_n$38-hybrid fault Hamiltonian and $\mathbb{Z}_m\wr S_n$39-hybrid fault Hamiltonian connected, and both bounds are tight (Dvořák et al., 2023, Zhu et al., 2024).

These burnt-pancake results are routinely interpreted in the source papers as evidence for the suitability of pancake-type Cayley graphs as interconnection networks. A plausible implication is that the same recursive toolkit—cluster decomposition, matching-like inter-cluster edges, and inductive Hamiltonicity arguments—should remain useful in broader generalized pancake settings, although the supplied corpus proves such robustness explicitly only for $\mathbb{Z}_m\wr S_n$40.

Several open-ended directions surround the family. The spectral note restates conjectures about the precise spectral gap for large $\mathbb{Z}_m\wr S_n$41 and about possible coincidence between the spectral gap of the full graph and that of the quotient matrix (Greaves et al., 11 Sep 2025). The paired 2-DPC paper asks whether the $\mathbb{Z}_m\wr S_n$42 fault bound can be improved to $\mathbb{Z}_m\wr S_n$43 in $\mathbb{Z}_m\wr S_n$44 (Dvořák et al., 2023). A related fixed-degree variant, the cubic pancake graph $\mathbb{Z}_m\wr S_n$45, has recently been studied through the problem of characterizing triples of prefix reversals that generate $\mathbb{Z}_m\wr S_n$46; that work gives full characterizations for triples containing at least one of $\mathbb{Z}_m\wr S_n$47, $\mathbb{Z}_m\wr S_n$48, $\mathbb{Z}_m\wr S_n$49, or $\mathbb{Z}_m\wr S_n$50, and reports computational data on girth, diameter, and Hamiltonicity for small $\mathbb{Z}_m\wr S_n$51 (Blanco et al., 21 Nov 2025).