The strongly regular (45,\,12,\,3,\,3) graphs

zbMATH Open1098.05081MaRDI QIDQ2500951FDOQ2500951

Authors J. Degraer, Kris Coolsaet, Edward Spence 

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/126517

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

automorphism groupsbacktrack algorithms

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04)

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

(28)

• scientific article; zbMATH DE number 3880742 (Why is no real title available?)
• New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
• On a family of highly regular graphs by Brouwer, Ivanov, and Klin
• Strongly regular graphs from classical generalized quadrangles
• scientific article; zbMATH DE number 26308 (Why is no real title available?)
• Strongly regular configurations
• New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
• Non rank 3 strongly regular graphs with the 5-vertex condition
• Enumeration of symmetric \((45,12,3)\) designs with nontrivial automorphisms
• Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs
• On automorphisms of distance-regular graphs
• Regular star complements in strongly regular graphs
• The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition
• Implementing Brouwer's database of strongly regular graphs
• The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
• There is no (75,32,10,16) strongly regular graph
• 5-chromatic strongly regular graphs
• Strongly regular tri-Cayley graphs
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Regular two-graphs on 36 vertices
• Coined quantum walks lift the cospectrality of graphs and trees
• The strongly regular (40, 12, 2, 4) graphs
• scientific article; zbMATH DE number 7640089 (Why is no real title available?)
• Disconnecting strongly regular graphs
• Strongly regular graphs with parameters \((37, 18, 8, 9)\) having nontrivial automorphisms
• Strongly regular graphs with non-trivial automorphisms
• Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
• Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs

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)