On graphs with multiple eigenvalues Original Research Article

Let image(μ) be an eigenspace of a finite graph G, with dimension m and codimension t >1. It is shown that if μ negated set membership {−1, 0} then image. A necessary and sufficient condition for μ to be a multiple eigenvalue of G is established, and used to construct examples from intersecting families of sets.