Abstract
For G being a graph with n vertices and m edges, and with Laplacian eigenvalues μ1≥μ2≥⋯≥μn−1≥μn=0, the Laplacian energy is defined as LE=∑i=1n|μi−2m/n|. Let σ be the largest positive integer such that μσ ≥ 2m/n. We characterize the graphs satisfying σ=n−1. Using this, we obtain lower bounds for LE in terms of n, m, and the first Zagreb index. In addition, we present some upper bounds for LE in terms of graph invariants such as n, m, maximum degree, vertex cover number, and spanning tree packing number.
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.
