Automorphism group and diameter of a graph

作者：Dankelmann P^*; Erwin D; Mukwembi S; Rodrigues B G; Mwambene E; Sabidussi G

来源：Journal of Graph Theory, 2012, 70(1): 80-91.

DOI：10.1002/jgt.20602

• automorphism group
• diameter

Given a connected graph G of order n and diameter d, we establish a tight upper bound for the order of the automorphism group of G as a function of n and d, and determine the graphs for which the bound is attained.

• 出版日期2012-5