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.

learn more… | top users | synonyms

1
vote
2answers
76 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 ...
0
votes
0answers
92 views

Articles on (Strongly Regular) Graphs and Covering Arrays / Covering Designs?

In their book "Algebraic Graph Theory" Godsil and Royle mention the connection of strongly regular graphs with latin squares and thus Orthogonal Arrays (Chapter 10.4). There seems not to be much ...
2
votes
2answers
267 views

What is the state of the art on triangle-free strongly regular graphs?

From what I've read I've gathered the following facts: There are seven known such graphs. Certain parameter sets are ruled out by the Krein conditions and the absolute bound. Beyond that, little or ...