On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

DOI10.37236/8954MaRDI QIDQ783063zbMATH OpenOpenAlexFDO

Authors Robert F. Bailey, Daniel R. Hawtin

Publication date 30 July 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1908.07104

zbMATH Keywords

coset graphKoolen-Riebeek graphMcLaughlin graphSoicher graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25)

Abstract: This paper considers three imprimitive distance-regular graphs with 486 vertices and diameter 4: the Koolen--Riebeek graph (which is bipartite), the Soicher graph (which is antipodal), and the incidence graph of a symmetric transversal design obtained from the affine geometry $mathrmAG(5,3)$ (which is both). It is shown that each of these is preserved by the same rank-9 action of the group $3^5:(2imes{M}_{10})$, and the connection is explained using the ternary Golay code.

Recommendations

• On some distance-regular graphs with many vertices
• A new distance-regular graph of diameter 3 on 1024 vertices
• On a class of vertex-transitive distance-regular covers of complete graphs. II
• scientific article; zbMATH DE number 43547
• Three new distance-regular graphs

Cites work

• scientific article; zbMATH DE number 3884175 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 976829 (Why is no real title available?)
• scientific article; zbMATH DE number 1382770 (Why is no real title available?)
• scientific article; zbMATH DE number 3407720 (Why is no real title available?)
• A new distance-regular graph associated to the Mathieu group \(M_{10}\)
• Antipodal distance-transitive covers of complete bipartite graphs
• Distance-regular graphs
• On symmetric nets and generalized Hadamard matrices from affine designs
• On the metric dimension of incidence graphs
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• The Magma algebra system. I: The user language
• The number of designs with classical parameters grows exponentially
• Three new distance-regular graphs

Describes a project that uses

Uses Software

• DESIGN
• Magma
• GAP

This page was built for publication: On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

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