Antipodal distance transitive covers of complete graphs

C.D. Godsil; R.A. Liebler; Cheryl Praeger

doi:10.1006/eujc.1997.0190

Antipodal distance transitive covers of complete graphs

C.D. Godsil, R.A. Liebler, Cheryl Praeger

Research output: Contribution to journal › Article

42 Citations (Scopus)

Abstract

A distance-transitive antipodal cover of a complete graph K-n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for such a graph. Several new infinite families of distance-transitive graphs are constructed. (C) 1998 Academic Press.

Original language	English
Pages (from-to)	455-478
Journal	European Journal of Combinatorics
Volume	19
Issue number	4
DOIs	https://doi.org/10.1006/eujc.1997.0190
Publication status	Published - 1998

Access to Document

10.1006/eujc.1997.0190

Fingerprint Dive into the research topics of 'Antipodal distance transitive covers of complete graphs'. Together they form a unique fingerprint.

Cite this

@article{748c62a870fe4754974c64b48286364b,

title = "Antipodal distance transitive covers of complete graphs",

abstract = "A distance-transitive antipodal cover of a complete graph K-n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for such a graph. Several new infinite families of distance-transitive graphs are constructed. (C) 1998 Academic Press.",

author = "C.D. Godsil and R.A. Liebler and Cheryl Praeger",

year = "1998",

doi = "10.1006/eujc.1997.0190",

language = "English",

volume = "19",

pages = "455--478",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "4",

}

TY - JOUR

T1 - Antipodal distance transitive covers of complete graphs

AU - Godsil, C.D.

AU - Liebler, R.A.

AU - Praeger, Cheryl

PY - 1998

Y1 - 1998

N2 - A distance-transitive antipodal cover of a complete graph K-n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for such a graph. Several new infinite families of distance-transitive graphs are constructed. (C) 1998 Academic Press.

AB - A distance-transitive antipodal cover of a complete graph K-n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for such a graph. Several new infinite families of distance-transitive graphs are constructed. (C) 1998 Academic Press.

U2 - 10.1006/eujc.1997.0190

DO - 10.1006/eujc.1997.0190

M3 - Article

VL - 19

SP - 455

EP - 478

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 4

ER -