Groups of automorphisms of finite regular cubic graphs (Q1814071)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Groups of automorphisms of finite regular cubic graphs |
scientific article; zbMATH DE number 5773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Groups of automorphisms of finite regular cubic graphs |
scientific article; zbMATH DE number 5773 |
Statements
Groups of automorphisms of finite regular cubic graphs (English)
0 references
25 June 1992
0 references
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}\).
0 references
automorphism group
0 references
regular cubic graph
0 references
