Premium
Cubic graphs with most automorphisms
Author(s) -
van Opstall Rev. Michael A.,
Veliche Răzvan
Publication year - 2010
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20441
Subject(s) - combinatorics , mathematics , automorphism , cubic graph , symmetric graph , graph automorphism , vertex transitive graph , graph , upper and lower bounds , coxeter graph , distance regular graph , discrete mathematics , line graph , voltage graph , mathematical analysis
We give a sharp bound for the order of the automorphism group of a connected simple cubic graph on a given number of vertices. For each number of vertices we construct a graph, unique in special cases, attaining the bound. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 99–115, 2010
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom