Highly Influenced

# SOME RESULTS ON GRAPHS WITH EXACTLY TWO MAIN EIGENVALUES

@inproceedings{Lepovic2002SOMERO, title={SOME RESULTS ON GRAPHS WITH EXACTLY TWO MAIN EIGENVALUES}, author={Mirko Lepovic}, year={2002} }

- Published 2002

where ni = nβ 2 i (i = 1, 2); β1 and β2 denote the main angles of μ1 and μ2, respectively. Further, let G be any connected or disconnected graph (not necessarily with two main eigenvalues). Let S be any subset of the vertex set V (G) and let GS be the graph obtained from the graph G by adding a new vertex x which is adjacent exactly to the vertices from S. If σ(GS1) = σ(GS2) then we prove that σ(GS1) = σ(GS2) if and only if σ(GT1) = σ(GT2), where σ(G) is the spectrum of G and Ti = V (G) \ Si… CONTINUE READING