\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Kris Coolsaet, Jan Degraer and Edward Spence}
%
%
\medskip
\noindent
%
%
{\bf The Strongly Regular $(45,12,3,3)$ Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
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$.
\bye