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

MaRDI QIDQ2500951zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r32.html

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

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

Review text

Summary: Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters \(v=45\), \(k=12\), \(\lambda=\mu=3\). It turns out that there are \(78\) such graphs, having automorphism groups with sizes ranging from \(1\) to \(51840\).

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)