Cubic graphs with most automorphisms
From MaRDI portal
Abstract: We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
Recommendations
Cites work
- A census of semisymmetric cubic graphs on up to 768 vertices
- Automorphisms of trivalent graphs
- scientific article; zbMATH DE number 1750091 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- On the Number of Automorphisms of a Regular Graph
- On the Symmetry of Cubic Graphs
Cited in
(7)- Groups of automorphisms of finite regular cubic graphs
- Upper bounds on the automorphism group of a graph
- Kissing numbers of regular graphs
- Brill-Noether theory of maximally symmetric graphs
- scientific article; zbMATH DE number 10017 (Why is no real title available?)
- Symmetric cubic graphs with solvable automorphism groups
- On symmetries of Cayley graphs and the graphs underlying regular maps
This page was built for publication: Cubic graphs with most automorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055908)