Alternating Cycle Quotient Type in Cubic Graphs

• Alternating Cycle Quotient Type is defined for cubic graphs that decompose into a 2-factor (cycles) and a perfect matching with an alternating incidence structure.
• Its construction leverages voltage-type methods for precise parameterization, enabling classification into arc-regular and 2-arc-regular families.
• The framework unifies classical families like generalized Petersen and honeycomb-toroidal graphs, offering insights into graph symmetry and factorization.

An alternating cycle quotient type is a structural property of finite, highly symmetric graphs—in particular, of connected cubic (valency three) vertex-transitive graphs—where the graph admits a decomposition into a $2$-factor (disjoint union of cycles) and a $1$-factor (perfect matching) in such a way that, modulo the $2$-factor, the quotient graph is a cycle and the incidence structure of the matching alternates around the cycles. This property leads to deep classification problems and construction methods, with applications extending to the study of graphs with half-arc-transitive group actions, generalizations of well-known graph families (such as the generalized Petersen and honeycomb-toroidal graphs), and the analysis of symmetry types in both cubic and quartic graphs.

1. Precise Definition and Alternating Structure

Let $\Gamma$ be a connected cubic graph, and $E(\Gamma)$ be its edge set. Suppose $E(\Gamma)$ can be partitioned into

$$E(\Gamma) = E(\mathcal{C}) \;\dot{\cup}\; E(\mathcal{I})$$

where $\mathcal{C}$ is a $2$-factor (each component is a cycle), and $\mathcal{I}$ is a perfect matching. If a vertex-transitive group $G \leq \operatorname{Aut}(\Gamma)$ preserves $\mathcal{C}$, the quotient graph $\Gamma/\mathcal{C}$, whose vertices correspond to cycles of $\mathcal{C}$ and where adjacency reflects matching edges connecting cycles, is well-defined.

A graph $\Gamma$ is called to be of cycle-quotient type if $\Gamma/\mathcal{C} \cong C_m$ for some $m$, a cycle.

The alternating cycle-quotient type arises under the additional condition that, as one traverses each cycle $C_i$ in $\mathcal{C}$, the matching edges' endpoints alternate between the two adjacent cycles in the quotient cycle $C_m$. That is,

$$u_{i,j}^* \in C_{i+1} \Longleftrightarrow u_{i,j+1}^* \in C_{i-1}$$

for all $i,j$, where $u_{i,j}$ is the $j$th vertex of the $i$th cycle, and $u_{i,j}^*$ is its unique outside neighbor via the matching. In this case, the induced action of $G$ on the quotient $C_m$ is the dihedral group $D_{2m}$ (Alspach et al., 2023).

2. Structural Reduction and Parameterization

Key structural lemmas demonstrate that all alternating cycle-quotient-type graphs with a vertex-transitive subgroup preserving the $2$-factor can be coordinatized to a specific voltage-type construction $X_a(m,n,k,l)$. Precisely, for

• $m \ge 4$ even (number of cycles in the $2$-factor),
• $n \ge 6$ even (length of each cycle),
• $k \in \mathbb{Z}_n$ odd, $\gcd(k,n)=1$, $2k^2 \equiv \pm 2 \pmod n$, $2k \not\equiv \pm 2 \pmod n$,
• $l \in \mathbb{Z}_n$, $l \equiv m \pmod 2$,

define $X_a(m,n,k,l)$ by vertex set $V=\{u_{i,j}\}$, and edges

$$\begin{aligned} &u_{i,j} \sim u_{i,j+1}, \ &u_{i,j} \sim u_{i+1,j} \quad \text{if } i+j \equiv 0 \pmod 2,\ &u_{i,j} \sim u_{i+1,j+k} \quad \text{if } i+j \equiv 1 \pmod 2,\ &u_{m-1,j} \sim u_{0,j+l}, \quad \text{for } j \equiv m-1 \pmod 2\,, \end{aligned}$$

with indices modulo $m$ and $n$ [(Alspach et al., 2023), Cor. 5.2, Prop. 5.6].

This construction encodes all possible combinatorial types subject to the alternating criterion. The existence of a group involution fixing the $2$-factor pointwise is equivalent to $2l \equiv 0 \pmod n$.

3. Classification of Alternating Cycle-Quotient-Type Cubic Graphs

The classification theorem precisely characterizes all connected cubic vertex-transitive graphs of order $mn$ with an alternating cycle-quotient decomposition. Such a graph $\Gamma$ admits a vertex-transitive subgroup preserving the $2$-factor if and only if exactly one of the following holds:

1. $\Gamma \cong \mathrm{HTG}(m,n,l)$, the honeycomb toroidal graph, where $l \equiv m \pmod 2$.
2. $\Gamma \cong X_a(m,n,k,l)$, with $k$ and $l$ as above, together with:

$$2k^2 \equiv \pm 2,\quad 2k \not\equiv \pm 2, \quad l \equiv m \pmod{2}$$

and either

$$l\,k\equiv\pm l\pmod n, \text{ and } (k^2\equiv\pm1\pmod n \text{ or } 4\mid m)$$

or

$$l\,k \equiv n'\mp l \pmod n, \quad m\equiv2\pmod4, \quad k^2\equiv\mp1\pmod n$$

with $n=2n'$ [(Alspach et al., 2023), Thm. 6.2].

Conversely, all graphs constructed in these forms admit the required symmetry.

4. Arc-Regular and 2-Arc-Regular Infinite Subfamilies

Within the family $X_a(m,n,k,l)$, one obtains infinite families of both arc-regular and $2$-arc-regular cubic graphs, i.e., graphs for which the automorphism group acts regularly on arcs or $2$-arcs, respectively.

Examples include:

• For any $m_1 \ge 1$,

$m=8m_1+2,\quad n=4m,\quad k=m+1,\quad l=0$

yields a $2$-arc-regular family.

• Likewise,

$m=8m_1+2,\quad n=12m,\quad k=3m+1,\quad l=6m$

also gives $2$-arc-regular graphs.

• Infinite arc-regular examples: $m=8m_1 - 2$, $n=28m$, $k=7m+1$, $l=12m$ satisfy the regularity conditions but not the $2$-arc-regular exceptions (Alspach et al., 2023).

These infinite subfamilies generalize several classic cubic symmetric graphs.

5. Generalized Petersen and Honeycomb-Toroidal Graphs as Special Cases

Two classical graph families emerge as degenerate cases of $X_a(m,n,k,l)$:

• The generalized Petersen graphs $GP(n,k)$ are precisely

$X_a(2,n,k,0)\cong GP(n,k)$

when $m=2$, $l=0$.

• The honeycomb toroidal graphs are those with $k=1$:

$$X_a(m,n,1,l)\cong \mathrm{HTG}(m,n,l), \quad l\equiv m \pmod{2}$$

These inclusions illustrate that the alternating cycle-quotient type unifies both families under a single parameterized construction (Alspach et al., 2023).

6. Alternating Cycles and Quotients in Half-Arc-Transitive Quartic Graphs

Although the focus is cubic graphs, parallel developments occur in quartic (valency $4$) graphs with half-arc-transitive actions. Here, alternating cycles are defined as cycles in which edge orientations alternate direction at every step: $$(v_i \to v_{i+1}) \Longleftrightarrow (v_{i+2} \to v_{i+1})$$ for all $i$ modulo the even cycle length. Families such as $X(r)=C_{2r}\square C_{2r}$, $Y(r)=X(r)/M(r)$, and $Z(s)=C_s\square C_s$ are classified according to their alternating-cycle attachment (loose, antipodal, tight), and their normal quotients can in turn yield alternating cycle quotient types (Al-bar et al., 2016).

A notable result is that these quartic grid-like graphs admit only three (up to reversal and conjugacy) edge-orientations preserved by half-arc-transitive subgroups, corresponding precisely to the different alternating cycle attachments [(Al-bar et al., 2016), Thm. 1.3].

7. Synthesis, Basic Objects, and Cross-Family Phenomena

The alternating cycle-quotient type creates a bridge between combinatorial constructions, symmetry group actions, and graph covering theory. The explicit classification identifies all alternating cubic vertex-transitive graphs with cycle-quotient structure, exhibits their infinite arc-regular and $2$-arc-regular subfamilies, and situates both the generalized Petersen and honeycomb-toroidal graphs as specific cases.

In quartic half-arc-transitive context, the analysis of alternating-cycle normal quotients reveals a rich structure of basic graphs (whose only proper normal quotients are degenerate) and unexpected cross-over relationships between apparently distinct families, demonstrating internal unification at a deeper structural level (Al-bar et al., 2016).

These investigations provide a comprehensive description of alternating cycle-quotient structures and underpin current treatments of symmetry and factorization in highly regular graphs (Alspach et al., 2023, Al-bar et al., 2016).