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

DOI10.37236/8954zbMath1444.05153arXiv1908.07104OpenAlexW3045782456MaRDI QIDQ783063

Robert F. Bailey, Daniel R. Hawtin

Publication date: 30 July 2020

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

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

zbMATH Keywords

coset graphKoolen-Riebeek graphMcLaughlin graphSoicher graph

Mathematics Subject Classification ID

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

Uses Software

• GAP
• Magma
• DESIGN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• The number of designs with classical parameters grows exponentially
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• A new distance-regular graph associated to the Mathieu group \(M_{10}\)
• Three new distance-regular graphs
• The Magma algebra system. I: The user language
• On the metric dimension of incidence graphs
• On symmetric nets and generalized Hadamard matrices from affine designs
• Antipodal distance-transitive covers of complete bipartite graphs