Groups of automorphisms of finite regular cubic graphs (Q1814071): Difference between revisions

Connected nonoriented graphs without loops are considered. A graph is called a regular cubic one if every vertex has degree 3 and the automorphism group acts transitively on the set of ordered pairs of adjacent vertices. The main result presented in the paper is the following. For \(n\neq 10\) any automorphism group of a regular cubic graph with \(2(n-1)\) vertices is imbedded in one of the groups \(\text{Aut }F_ n\) or \(S_ 2\times S_{n+1}\).