Content deleted Content added
Suntooooth (talk | contribs) Changing short description from "Regular graph where every two directly connected vertices have the same number of mutual neighbors, as do every two indirectly connected vertices." to "Concept in graph theory" |
m Ce |
||
Line 3:
{{Graph families defined by their automorphisms}}
In [[graph theory]], a '''strongly regular graph''' ('''SRG''') is a [[regular graph]] {{math|1=''G'' = (''V'', ''E'')}} with {{mvar|v}} vertices and [[Degree (graph theory)|degree]] {{mvar|k}} such that
*
for some integers <math>\lambda, \mu \ge 0.</math>▼
▲* Every two non-adjacent vertices have {{math|μ}} common neighbours,
▲for some integers <math>\lambda, \mu \ge 0</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'' + λ)}}.
| |||