Cubic vertex-transitive graphs admitting automorphisms of large order
Combinatorics
2022-08-15 v1
Abstract
A connected graph of order admitting a semiregular automorphism of order is called a -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 admitting an automorphism of order or larger that may not be semiregular. In particular, we show that any such graph is either a -multicirculant for some , or it belongs to an infinite family of graphs of girth .
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}
}