The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris; Degraer, Jan; Spence, Edward
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R32, 9 p.-Research paper R32, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCoolsaet, Kris, Degraer, Jan, and Spence, Edward. "The strongly regular (45, 12, 3, 3) graphs.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R32, 9 p.-Research paper R32, 9 p.. <http://eudml.org/doc/126517>.
@article{Coolsaet2006,
author = {Coolsaet, Kris, Degraer, Jan, Spence, Edward},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {backtrack algorithms; automorphism groups},
language = {eng},
number = {1},
pages = {Research paper R32, 9 p.-Research paper R32, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The strongly regular (45, 12, 3, 3) graphs.},
url = {http://eudml.org/doc/126517},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Coolsaet, Kris
AU - Degraer, Jan
AU - Spence, Edward
TI - The strongly regular (45, 12, 3, 3) graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R32, 9 p.
EP - Research paper R32, 9 p.
LA - eng
KW - backtrack algorithms; automorphism groups
UR - http://eudml.org/doc/126517
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.