Strongly regular graph: Difference between revisions

Content deleted Content added
Eigenvalues and graph spectrum: Refer to existing citation that covers all these relations.
Tags: Mobile edit Mobile web edit Advanced mobile edit
Eigenvalues and graph spectrum: Avoid having a dangling period on its own line
Tags: Mobile edit Mobile web edit Advanced mobile edit
Line 133:
Since the sum of all the eigenvalues is the [[Trace (linear algebra)|trace of the adjacency matrix]], which is zero in this case, the respective multiplicities ''f'' and ''g'' can be calculated:
* Eigenvalue ''k'' has [[Multiplicity (mathematics)|multiplicity]] 1.
* Eigenvalue <math>r = \frac{1}{2}\left[(\lambda - \mu) + \sqrt{(\lambda - \mu)^2 + 4(k - \mu)}\,\right]</math> has multiplicity <math>f = \frac{1}{2}\left[(v - 1) - \frac{2k + (v - 1)(\lambda - \mu)}{\sqrt{(\lambda - \mu)^2 + 4(k - \mu)}}\right]</math>.
* Eigenvalue <math>s = \frac{1}{2}\left[(\lambda - \mu) - \sqrt{(\lambda - \mu)^2 + 4(k-\mu)}\,\right]</math> has multiplicity <math>g = \frac{1}{2}\left[(v - 1) + \frac{2k + (v - 1)(\lambda - \mu)}{\sqrt{(\lambda - \mu)^2 + 4(k - \mu)}}\right]</math>.
 
As the multiplicities must be integers, their expressions provide further constraints on the values of ''v'', ''k'', ''μ'', and ''λ''.