English

Cubic factor-invariant graphs of cycle quotient type -- the alternating case

Combinatorics 2026-01-19 v1

Abstract

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a 22-factor C\mathcal{C} and a 11-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where the quotient graph with respect to C\mathcal{C} is a cycle. There are two essentially different types of such cubic graphs. In this paper we focus on the examples of what we call the alternating type. We classify all such examples admitting a vertex-transitive subgroup of the automorphism group of the graph preserving the corresponding 22-factor and also determine the ones for which the 22-factor is invariant under the full automorphism group of the graph. In this way we introduce a new infinite family of cubic vertex-transitive graphs that is a natural generalization of the well-known generalized Petersen graphs as well as of the honeycomb toroidal graphs. The family contains an infinite subfamily of arc-regular examples and an infinite family of 22-arc-regular examples.

Keywords

Cite

@article{arxiv.2305.19661,
  title  = {Cubic factor-invariant graphs of cycle quotient type -- the alternating case},
  author = {Brian Alspach and Primoz Sparl},
  journal= {arXiv preprint arXiv:2305.19661},
  year   = {2026}
}

Comments

26 pages