The strongly regular (45,\,12,\,3,\,3) graphs (Q2500951): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Kris Coolsaet / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Spence, Edward / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 07:23, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strongly regular (45,\,12,\,3,\,3) graphs |
scientific article |
Statements
The strongly regular (45,\,12,\,3,\,3) graphs (English)
0 references
30 August 2006
0 references
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\).
0 references
backtrack algorithms
0 references
automorphism groups
0 references
