Cubic edge-transitive graphs of order
Xue Wang, Jun-Jie Huang, Da-Wei Yang
Source abstract
A graph is edge-transitive if its automorphism group acts transitively on its edge set. This paper is devoted to a systematic study of cubic edge-transitive graphs of order , where is a prime and is an even integer. We first show that either is the unique cubic edge-transitive graph of order , or its full automorphism group contains a normal Sylow -subgroup which is isomorphic to either or . For the case , we prove that is either arc-regular or edge-regular, and provide a complete classification of such graphs. For the case , we prove that is a normal cover of certain known graphs. This work generalizes previous classifications by Zhou and Feng (2024), Lu et al.~(2004), and others. As an application, we obtain a classification of cubic edge-transitive graphs of order in the case where is square-free.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.