The strongly regular (45,\,12,\,3,\,3) graphs
From MaRDI portal
Publication:2500951
Recommendations
- The strongly regular (40, 12, 2, 4) graphs
- scientific article; zbMATH DE number 1567921
- scientific article; zbMATH DE number 26308
- Some new strongly regular graphs
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- Strongly regular tri-Cayley graphs
- On strongly regular graphs with eigenvalue 3 and their extensions
- On strongly regular graphs with \(b_1<24\)
- A generalization of strongly regular graphs
Cited in
(31)- Strongly regular tri-Cayley graphs
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- Strongly regular graphs from classical generalized quadrangles
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- There is no (75,32,10,16) strongly regular graph
- Regular two-graphs on 36 vertices
- The strongly regular (40, 12, 2, 4) graphs
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- Strongly regular configurations
- Coined quantum walks lift the cospectrality of graphs and trees
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- Implementing Brouwer's database of strongly regular graphs
- On automorphisms of distance-regular graphs
- Classification of some strongly regular subgraphs of the McLaughlin graph
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Disconnecting strongly regular graphs
- scientific article; zbMATH DE number 3880742 (Why is no real title available?)
- Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs
- scientific article; zbMATH DE number 26308 (Why is no real title available?)
- Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
- scientific article; zbMATH DE number 7640089 (Why is no real title available?)
- Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms
- Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms
- The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition
- Strongly regular graphs with non-trivial automorphisms
- Regular star complements in strongly regular graphs
- On clique graphs and clique regular graphs
- On the twin-width of near-regular graphs
- Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
- 5-chromatic strongly regular graphs
- Non rank 3 strongly regular graphs with the 5-vertex condition
This page was built for publication: The strongly regular (45,\,12,\,3,\,3) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500951)