Premium
Automorphism group and diameter of a graph
Author(s) -
Dankelmann P.,
Erwin D.,
Mukwembi S.,
Rodrigues B. G.,
Mwambene E.,
Sabidussi G.
Publication year - 2012
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.20602
Subject(s) - mathematics , combinatorics , graph automorphism , automorphism , automorphism group , graph , edge transitive graph , vertex transitive graph , symmetric graph , upper and lower bounds , discrete mathematics , order (exchange) , voltage graph , line graph , mathematical analysis , finance , economics
Given a connected graph Γ of order n and diameter d , we establish a tight upper bound for the order of the automorphism group of Γ as a function of n and d , and determine the graphs for which the bound is attained. © 2011 Wiley Periodicals, Inc. J Graph Theory.
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