English

Cubic vertex-transitive graphs admitting automorphisms of large order

Combinatorics 2022-08-15 v1

Abstract

A connected graph of order nn admitting a semiregular automorphism of order n/kn/k is called a kk-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for cubic vertex- and arc-transitive multicirculants. In this paper we study the broader class of cubic vertex-transitive graphs of order nn admitting an automorphism of order n/3n/3 or larger that may not be semiregular. In particular, we show that any such graph is either a kk-multicirculant for some k3k \leq 3, or it belongs to an infinite family of graphs of girth 66.

Keywords

Cite

@article{arxiv.2208.06189,
  title  = {Cubic vertex-transitive graphs admitting automorphisms of large order},
  author = {Primož Potočnik and Micael Toledo},
  journal= {arXiv preprint arXiv:2208.06189},
  year   = {2022}
}
R2 v1 2026-06-25T01:39:45.993Z