Cubic graphs with most automorphisms

2006/08/25 by van Opstall, Michael A., Veliche, Razvan
#05C #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.math/0608645

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.

Related

• Polyhedral Maps of Cubic Graphs with given Automorphism Groups
• Finite cubic graphs admitting an cyclic group of automorphisms with at most three orbits on vertices
• On cubic symmetric non-Cayley graphs with solvable automorphism groups
• Maximally symmetric stable curves II
• Semiregular automorphisms of cubic vertex-transitive graphs