The classification of distance-transitive graphs of type \(q.K_{q,q}\)

DOI10.1016/S0195-6698(13)80079-0zbMath0771.05047OpenAlexW2024658482MaRDI QIDQ1174156

Robert A. Liebler

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80079-0

zbMATH Keywords

diameterprojective planeDesarguesian planescliquesdistance-transitive graphs\(q\)-fold antipodal coverHering's theorem

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Non-Desarguesian affine and projective planes (51A35) Desarguesian and Pappian geometries (51A30)

Related Items (2)

Distance-transitive antipodal covers: The extremal case ⋮ Finite primitive distance-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Transitive linear groups and linear groups which contain irreducible subgroups of prime order. II
• On a conjecture of Kallaher and Liebler
• On nonsingular tensors and related projective planes
• Distance-transitive graphs of type \(q.K_{q,q}\) and projective planes
• Finite affine planes of rank three are translation planes
• Imprimitive distance-regular graphs and projective planes
• On the Orders of Maximal Subgroups of the Finite Classical Groups
• The Affine Permutation Groups of Rank Three

This page was built for publication: The classification of distance-transitive graphs of type \(q.K_{q,q}\)