Antipodal distance transitive covers of complete graphs

Abstract

A distance-transitive antipodal cover of a complete graph Kn 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. © 1998 Academic Press.