On the 486-vertex distance-regular graphs of Koolen--Riebeek and Soicher
Combinatorics
2020-07-14 v2 Group Theory
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 (which is both). It is shown that each of these is preserved by the same rank-9 action of the group , and the connection is explained using the ternary Golay code.
Keywords
Cite
@article{arxiv.1908.07104,
title = {On the 486-vertex distance-regular graphs of Koolen--Riebeek and Soicher},
author = {Robert F. Bailey and Daniel R. Hawtin},
journal= {arXiv preprint arXiv:1908.07104},
year = {2020}
}
Comments
11 pages, 7 figures