On the distribution of eigenvalues of graphs

Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 k [n 2 ],such that k(G) = -1, then

• Type: Journal
• Year: 1999
• Where: DM
• Authors: Alexander K. Kelmans, Xuerong Yong
• Keywords: DM 1999, Ith Largest Eigenvalue, Simple Graph