Abstract

The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition \(c_2=1\) (which means that every two vertices at distance 2 have exactly one common neighbour).Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with \(c_2=1\) is either the second neighbourhood of a vertex in a Moore graph of valency 3 or 7, or a Mathon graph, or a half-transitive graph whose automorphism group induces an affine \(2\)-homogeneous group on the set of its fibres. Moreover, distance-regular antipodal covers of complete graphs with \(c_2=1\) that admit an automorphism group acting \(2\)-homogeneously on the set of fibres (which turns out to be an approximation of the property of edge-transitivity of such cover), are described. A well-known correspondence between distance-regular antipodal covers of complete graphs with \(c_2=1\) and geodetic graphs of diameter two that can be viewed as underlying graphs of certain Moore geometries, allows us to effectively restrict admissible automorphism groups of covers under consideration by combining Kantor's classification of involutory automorphisms of these geometries together with the classification of finite 2-homogeneous permutation groups.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.