Antipodal distance transitive covers of complete graphs

被引：48

作者：

Godsil, CD

Liebler, RA

Praeger, CE

机构：

[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada

[2] Colorado State Univ, Dept Math, Ft Collins, CO 80523 USA

[3] Univ Western Australia, Dept Math, Nedlands, WA 6907, Australia

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1998年 / 19卷 / 04期

基金：

澳大利亚研究理事会; 美国国家科学基金会;

关键词：

D O I：

10.1006/eujc.1997.0190

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：455 / 478

页数：24

共 25 条

[1] NONEXISTENCE OF RAND 3 PERMUTATION GROUPS OF DEGREE 3250 AND SUBDEGREE 57 [J].