Strongly regular graph: Difference between revisions

Revision as of 07:31, 12 April 2022

Revision as of 13:28, 4 May 2022

Line 39:

===Eigenvalues===

The adjacency matrix of thea strongly regular graph has exactly three [[eigenvalue]]s:

* ''k'', whose [[Multiplicity (mathematics)|multiplicity]] is 1 (as seen above)

* <math>\frac{1}{2}\left[(\lambda - \mu) + \sqrt{(\lambda - \mu)^2 + 4(k - \mu)}\,\right],</math> whose multiplicity is <math>\frac{1}{2}\left[(v - 1) - \frac{2k + (v - 1)(\lambda - \mu)}{\sqrt{(\lambda - \mu)^2 + 4(k - \mu)}}\right]</math>