An infinite family of cubic one-regular graphs with unsolvable automorphism groups. (Q1402085)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1967278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infinite family of cubic one-regular graphs with unsolvable automorphism groups. |
scientific article; zbMATH DE number 1967278 |
Statements
An infinite family of cubic one-regular graphs with unsolvable automorphism groups. (English)
0 references
19 August 2003
0 references
A graph \(X\) is said to be vertex-transitive, edge-transitive, and arc-transitive if its automorphism group \(\Aut(X)\) is transitiv on the vertex set, edge set and arc set, respectively. A graph is said to be one-regular if \(\Aut(X)\) acts freely and transitively on the set of arcs. The first cubic one-regular graph was constructed by Frucht in 1952. Since then there is a large number of generalizations of this result. In this paper, an infinite family of cubic one-regular graphs with solvable automorphism group is constructed.
0 references
Cayley graphs
0 references
unsolvable groups
0 references
0.8251323103904724
0 references
0.8229951858520508
0 references
0.8223139047622681
0 references
0.8205568194389343
0 references
0.8205568194389343
0 references
