Strongly regular graph: Difference between revisions

Revision as of 14:37, 9 September 2023

Revision as of 14:39, 9 September 2023

Line 8:

* Every two non-adjacent vertices have {{math|μ}} common neighbours,

for some integers {{<math|>\lambda and, \mu}}.</math>

The [[complement graph|complement]] of an {{math|srg(''v'', ''k'', λ, μ)}} is also strongly regular. It is a {{math|srg(''v'', ''v'' − ''k'' − 1, ''v'' − 2 − 2''k'' + μ, ''v'' − 2''k'' + λ)}}.