arXiv · 1409.8080
On the orders of arc-transitive graphs
Abstract
A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In this paper we consider the orders of such graphs, for given valency. We prove that for any given positive integer $k$, there exist only finitely many connected 3-valent 2-arc-transitive graphs whose order is $kp$ for some prime $p$, and that if $d\ge 4$, then there exist only finitely many connected $d$-valent 2-arc-transitive graphs whose order is $kp$ or $kp^2$ for some prime $p$. We also prove that there are infinitely many (even) values of $k$ for which there are only finitely many connected 3-valent symmetric graphs of order $kp$ where $p$ is prime.
Explore related subjects
Keep this discovery
Marston D. E. Conder, Cai-Heng Li, Primoz Potocnik. 2014-09-29. On the orders of arc-transitive graphs. https://arxiv.org/abs/1409.8080
Cite the original work for its findings. Save a collection to share your selection of sources.