Antipodal distance-transitive covers of complete bipartite graphs

DOI10.1006/EUJC.1993.0086MaRDI QIDQ5961459zbMATH OpenOpenAlexWikidataFDO

Authors Alexander A. Ivanov, Robert A. Liebler, Tim Penttila, Cheryl E. Praeger

Publication date 9 July 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1993.0086

zbMATH Keywords

antipodal distance-transitive coversautomorphism groupbi-additive equivariant formsbipartite graphsdistance-transitive graphsprojective planestwisted field

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Association schemes, strongly regular graphs (05E30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Finite affine and projective planes (geometric aspects) (51E15)

Review text

This paper classifies all antipodal distance-transitive covers of complete bipartite graphs (of valency at least 3). Part of the general problem of classifying distance-transitive graphs concerns finding the antipodal covers of known distance-transitive graphs, of which the complete bipartite graphs are an extreme case. For an \(r\)-fold cover of the complete bipartite graph of valency \(k\), it was known that \(r \leq k\), and the case \(r = k\) had been previously classified, but this paper gives a unified treatment for all \(r\), including a small sharpening of the case \(r = k\) (which can arise from certain twisted-field projective planes). NEWLINENEWLINENEWLINEThe proof depends on the classification of finite simple groups (and the ensuing classification of 2-transitive groups), and breaks into two cases, almost simple versus affine groups. The bulk of the paper concerns the affine case, where the proof involves interpreting the commutator maps in certain \(p\)-groups as bi-additive equivariant forms. The main result is that, besides the ``generic case arising from projective geometries, there are three sporadic examples (two in the almost simple case and one in the affine case), and an infinite family of examples with solvable automorphism group (the authors give parameters and other information for this family but they say that ``complete enumeration of this surely large class of graphs could be difficult).

Recommendations

• Distance-transitive antipodal covers: The extremal case
• Antipodal distance transitive covers of complete graphs
• On a class of edge-transitive distance-regular antipodal covers of complete graphs
• On affine distance-regular covers of complete graphs

Cited in

(17)

• Imprimitive distance-transitive graphs with primitive core of diameter at least 3
• The classification of distance-transitive graphs of type \(q.K_{q,q}\)
• Antipodal distance transitive covers of complete graphs
• Distance-transitive antipodal covers: The extremal case
• Coverings of complete bipartite graphs and associated structures
• Antipodal covers of distance-transitive generalized polygons
• Distance-transitive graphs of type \(q.K_{q,q}\) and projective planes
• Families of nested completely regular codes and distance-regular graphs
• Smith's theorem and a characterization of the 6-cube as distance-transitive graph
• Locally 3-arc-transitive regular covers of complete bipartite graphs
• Properties of graphs of orbitals for overgroups of the Jevons group
• On a class of edge-transitive distance-regular antipodal covers of complete graphs
• On completely regular codes
• Finite 4-geodesic-transitive graphs with bounded girth
• The doubly-transitive focal-spreads
• On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
• Finite primitive distance-transitive graphs

This page was built for publication: Antipodal distance-transitive covers of complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961459)