Abstract:
A strongly regular graph $\Gamma$ with eigenvalue $m-1$ is called exceptional if it does not belong to the following list: (1) the union of isolated $m$-cliques, (2) a pseudogeometric graph for $pG_t(t+m-1,t)$, (3) the completion to a pseudogeometric graph for $pG_{m}(s,m-1)$, (4) a graph in the half case with parameters $(4\mu+1,2\mu,\mu-1,\mu)$, $\sqrt{4\mu+1}=m-1$. We find parameters of exceptional strongly regular graphs with nonleading eigenvalue 3.
Keywords:strongly regular graph, eigenvalue of a graph.