6
votes
Accepted
What is known about the non-existence of strongly regular graphs srg(n,k,0,2)?
Example 1 in A.Neumaier paper says in partcular that the vertex degree in this case must be $k=t^2+1$, for $t$ not divisible by 4. As well, the number of vertices is $v=1+k+\binom{k}{2}$. The examples ...
- 14k
4
votes
Accepted
Strongly regular graphs with certain parameters
I think, the answer is negative (I expect that by $\Omega(n)$ you mean something positive of order $n$). Denote $\mu-\lambda=k,d-\mu=\ell$.
The eigenvalues of the adjacency matrix of such a graph $G$ ...
- 109k
1
vote
Unique naming/labeling of $40$-node strongly regular graphs
This may not be exactly what you had in mind, but in the context of displaying information on web pages, there is a need for a canonical labelling of graph isomorphism classes.
The proposed web ...
- 3,979
1
vote
Automorphism group of a putative strongly regular graph
According to Andries Brouwer, the latest reference for that question is:
Behbahani & Lam,
Strongly regular graphs with non-trivial automorphisms,
Discr Math 311 (2011) 132-144
It shows that any ...
- 221
Only top scored, non community-wiki answers of a minimum length are eligible