Classification of some strongly regular subgraphs of the McLaughlin graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- A computer-assisted proof of the uniqueness of the Perkel graph
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- The regular two-graph on 276 vertices
Cited in
(11)- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- Developments on spectral characterizations of graphs
- The graph with spectrum \(14^{1} 2^{40}( - 4)^{10}( - 6)^{9}\)
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- A computer-assisted proof of the uniqueness of the Perkel graph
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
- Strongly regular graphs with non-trivial automorphisms
- Strongly regular tri-Cayley graphs
- Enumeration of Seidel matrices
- Implementing Brouwer's database of strongly regular graphs
- Ball packings with high chromatic numbers from strongly regular graphs
This page was built for publication: Classification of some strongly regular subgraphs of the McLaughlin graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468023)