Strongly regular graph: Difference between revisions

Content deleted Content added
m Ce
Line 7:
* every two non-adjacent vertices have {{math|μ}} common neighbours.
 
Such a strongly regular graph is denoted by {{math|srg(''v'', ''k'', λ, μ)}}. Its [[complement graph|complement]] is also strongly regular: it is an {{math|srg(''v'', ''v'' − ''k'' − 1, ''v'' − 2 − 2''k'' + μ, ''v'' − 2''k'' + λ)}}.
 
A strongly regular graph is a [[distance-regular graph]] with diameter 2 whenever μ is non-zero. It is a [[locally linear graph]] whenever {{math|1=λ = 1}}.