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

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
scientific article

    Statements

    On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2020
    0 references
    Summary: 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 AG(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:(2\times M_{10})\), and the connection is explained using the ternary Golay code.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    coset graph
    0 references
    Koolen-Riebeek graph
    0 references
    Soicher graph
    0 references
    McLaughlin graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references