The strongly regular (45,\,12,\,3,\,3) graphs (Q2500951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The strongly regular (45,\,12,\,3,\,3) graphs |
scientific article; zbMATH DE number 5050750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The strongly regular (45,\,12,\,3,\,3) graphs |
scientific article; zbMATH DE number 5050750 |
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
0.9453171
0 references
0 references
0.89565873
0 references
0.8943335
0 references
0 references
0.8880378
0 references
0.8863708
0 references
0.88620436
0 references
