Revision as of 09:31, 21 January 2024 edit Zaslav (talk \| contribs) Extended confirmed users 15,727 edits Define "parameters". ← Previous edit		Revision as of 18:47, 20 May 2024 edit undo Quack5quack (talk \| contribs) Extended confirmed users 1,064 edits Rm hiding Tags: Mobile edit Mobile web edit Advanced mobile edit Next edit →
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~~\|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}}.

Strongly regular graph: Difference between revisions