Abstract
The Laplacian spread of a graph G is defined as the difference between the largest and the second smallest eigenvalue of the Laplacian matrix of G. In this work, an upper bound for this graph invariant, that depends on first Zagreb index, is given. Moreover, another upper bound is obtained and expressed as a function of the nonzero coefficients of the Laplacian characteristic polynomial of a graph.
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.
