Abstract
The energy of a graph is defined as the sum of absolute values of all eigenvalues of its adjacency matrix. For a nonempty graph G, S. Akbari, A. Alazemi, M. Andelić and M.A. Hosseinzadeh proposed a conjecture: The energy of the line graph of G is at least |E(G)|+Δ(G)−3, where E(G) is the edge set of G and Δ(G) is the maximum degree of G. In this paper, we give a proof confirming the conjecture, and present a lower bound and an upper bound for the energy of line graphs of regular graphs.
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.
