# Questions tagged [strongly-regular-graph]

A strongly regular graph $G$ is a regular graph with the following additional property: there exist two integers $\lambda$ and $\mu$ such that every two adjacent vertices have $\lambda$ common neighbors and every two non-adjacent vertices have $\mu$ common neighbors.

6 questions
Filter by
Sorted by
Tagged with
58 views

### What is known about the non-existence of strongly regular graphs srg(n,k,0,2)?

Only two strongly regular graphs with parameters $\lambda=0$ (triangle-free) and $\mu=2$ (any two non-adjacent vertices have exactly two common neighbors) are known, see the wikipedia page: the ...
257 views

### A question related to Conways 99 graph problem

I have observed that the number of triangles $\frac{vk}{6}$ of a strongly regular graph with parameters $(v,k,1,2)$ is given by the coefficient $2(k-1)$ in the molien series of the "4-D extraspecial ...
394 views

### Generating (or availability of) large strongly regular graphs

Are there collections of already generated large strongly regular graphs available to download? By large I mean $n \geq 200$ where $n$ is the number of vertices. I found Ted Spence's page on srgs, ...
157 views

### Regular graphs with strongly regular edge colorings

Given a positive integer $c>1$, for what parameters $(v,k,\lambda,\mu)$ does there exist a $c k$ regular graph on $v$ vertices that can be given an edge coloring with $c$ colors, such that the ...