Automorphism group and diameter of a graph

P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi

doi:10.1002/jgt.20602

Automorphism group and diameter of a graph

P. Dankelmann, D. Erwin, S. Mukwembi, B. G. Rodrigues, E. Mwambene, G. Sabidussi

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	80-91
Number of pages	12
Journal	Journal of Graph Theory
Volume	70
Issue number	1
DOIs	https://doi.org/10.1002/jgt.20602
Publication status	Published - May 2012
Externally published	Yes

Keywords

automorphism group
diameter

ASJC Scopus subject areas

Geometry and Topology

Access to Document

10.1002/jgt.20602

Cite this

@article{ec1b28e9ea3b4ec581872d404fb93247,

title = "Automorphism group and diameter of a graph",

abstract = "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.",

keywords = "automorphism group, diameter",

author = "P. Dankelmann and D. Erwin and S. Mukwembi and Rodrigues, \{B. G.\} and E. Mwambene and G. Sabidussi",

year = "2012",

month = may,

doi = "10.1002/jgt.20602",

language = "English",

volume = "70",

pages = "80--91",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Automorphism group and diameter of a graph

AU - Dankelmann, P.

AU - Erwin, D.

AU - Mukwembi, S.

AU - Rodrigues, B. G.

AU - Mwambene, E.

AU - Sabidussi, G.

PY - 2012/5

Y1 - 2012/5

N2 - 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.

AB - 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.

KW - automorphism group

KW - diameter

UR - https://www.scopus.com/pages/publications/84859898239

U2 - 10.1002/jgt.20602

DO - 10.1002/jgt.20602

M3 - Article

AN - SCOPUS:84859898239

SN - 0364-9024

VL - 70

SP - 80

EP - 91

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Automorphism group and diameter of a graph

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this