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 | |
| Publication status | Published - 1998 |
Fingerprint Dive into the research topics of 'Antipodal distance transitive covers of complete graphs'. Together they form a unique fingerprint.
Cite this
Godsil, C. D., Liebler, R. A., & Praeger, C. (1998). Antipodal distance transitive covers of complete graphs. European Journal of Combinatorics, 19(4), 455-478. https://doi.org/10.1006/eujc.1997.0190