On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
DOI10.37236/8954zbMATH Open1444.05153arXiv1908.07104OpenAlexW3045782456MaRDI QIDQ783063FDOQ783063
Authors: 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
Recommendations
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)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three new distance-regular graphs
- Distance-regular graphs
- Antipodal distance-transitive covers of complete bipartite graphs
- Title not available (Why is that?)
- The number of designs with classical parameters grows exponentially
- Title not available (Why is that?)
- On the metric dimension of incidence graphs
- On symmetric nets and generalized Hadamard matrices from affine designs
- A new distance-regular graph associated to the Mathieu group \(M_{10}\)
- Title not available (Why is that?)
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)