Abstract
We show that every limit point of the kth largest eigenvalues of graphs is a limit point of the ( k + 1)th largest eigenvalues, and we find out the smallest limit point of the kth largest eigenvalues and an upper bound of the limit points of the kth smallest eigenvalues. For k ≥ 4, we prove that there exists a gap beyond the smallest limit point in which no point is the limit point of the kth largest eigenvalues. For the third largest eigenvalues of a graph G with at least three vertices, we obtain that (1) λ 3( G) < −1 iff G ≅ P 3; (2) λ 3( G) = −1 iff G c is isomorphic to a complete bipartite graph plus isolated vertices: (3) there exist no graphs such that −1 < λ 3(G) < (1 − √5) 2 . Consequently, if G c is not a complete bipartite graph plus isolated vertices, λ 3(G) ≥ λ 3(D ∗ n) , where D ∗ n is the complement of the double star S(1, n − 3).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.