Geodesic
The strongly regular (45,\,12,\,3,\,3) graphs
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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$.
DOI : 10.37236/1058
Classification : 05E30, 05-04
Mots-clés : backtrack algorithms, automorphism groups 
Kris Coolsaet; Jan Degraer; Edward Spence. The strongly regular (45,\,12,\,3,\,3) graphs. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1058
@article{10_37236_1058,
     author = {Kris Coolsaet and Jan Degraer and Edward Spence},
     title = {The strongly regular (45,\,12,\,3,\,3) graphs},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1058},
     zbl = {1098.05081},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1058/}
}
TY  - JOUR
AU  - Kris Coolsaet
AU  - Jan Degraer
AU  - Edward Spence
TI  - The strongly regular (45,\,12,\,3,\,3) graphs
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1058/
DO  - 10.37236/1058
ID  - 10_37236_1058
ER  - 
%0 Journal Article
%A Kris Coolsaet
%A Jan Degraer
%A Edward Spence
%T The strongly regular (45,\,12,\,3,\,3) graphs
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1058/
%R 10.37236/1058
%F 10_37236_1058

Cité par Sources :