Some new lower bounds for energy of graphs

作者:

Highlights:

摘要

The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. In this paper we present some new lower bounds for energy of non-singular graphs, connected non-singular graphs and connected unicyclic non-singular graphs in terms of number of vertices, number of edges, maximum degree and Zagreb indices.

论文关键词:Eigenvalue,Energy,Non-singular graphs,Adjacency matrix

论文评审过程:Received 20 August 2016, Revised 14 September 2016, Accepted 10 October 2016, Available online 28 October 2016, Version of Record 28 October 2016.

论文官网地址:https://doi.org/10.1016/j.amc.2016.10.019