Strongly regular graph: Difference between revisions

Revision as of 08:15, 10 January 2025

Revision as of 11:27, 4 February 2025

Line 7:

* every two non-adjacent vertices have {{math|μ}} common neighbours.

Such a strongly regular graph is denoted by {{math|srg(''v'', ''k'', λ, μ)}}; its "parameters" are the numbers in (''v'', ''k'', λ, μ). Its [[complement graph]] 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}}.