Abstract
Let λ1(G) be the largest eigenvalue and λn(G) be the smallest eigenvalue of a k-connected irregular graph G with n vertices, m edges and maximum degree Δ. In this paper, we prove thatΔ−λ1(G)>(nΔ−2m)k2(nΔ−2m)[n2−2(n−k)]+nk2. This inequality improves previous results of several authors and implies two lower bounds on Δ+λn(G) which also refine some known bounds. Another lower bound on Δ−λ1(G) for a connected irregular graph G is given as well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
