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

From MaRDI portal
Publication:783063

DOI10.37236/8954zbMATH Open1444.05153arXiv1908.07104OpenAlexW3045782456MaRDI QIDQ783063FDOQ783063


Authors: Robert F. Bailey, Daniel R. Hawtin Edit this on Wikidata


Publication date: 30 July 2020

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

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 35:(2imesM10), and the connection is explained using the ternary Golay code.


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




Recommendations




Cites Work


Uses Software





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)