Cubic graphs with most automorphisms
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0608645,
title = {Cubic graphs with most automorphisms},
author = {Michael A. van Opstall and Razvan Veliche},
journal= {arXiv preprint arXiv:math/0608645},
year = {2007}
}
Comments
24 pages