New type bounds for energy of graphs and spread of matrices

Abstract

The energy of a simple graph G is defined as the sum of the absolute values of eigenvalues of the adjacency matrix of G. For a complex matrix M the spread of M is the maximum absolute value of the differences between any two eigenvalues of M. Thus if λ1,…,λn are the eigenvalues of M, then the spread of M is max1≤i,j≤n⁡|λi−λj|. The spread of a graph G is defined as the spread of its adjacency matrix and is denoted by s(G). The inertia of G is an integer triple (n+,n−,n0) specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix of G. In this paper we find some bounds for energy of graphs in terms of some parameters of graphs such as rank, inertia and spread of graphs. We find some bounds for spread of graphs and matrices that improve the previous bounds. In particular, we show that if G is a graph with m edges and inertia (n+,n−,n0), then s(G)≥2m(n++n−)n+n− and the equality holds if and only if G=rKs∪tK1 or G=rKp,…,p︸q∪tK1 or G=r1Ka1,b1∪⋯∪rhKah,bh, for some non-negative integers r,s,t,p,q and r1,a1,b1,…,rh,ah,bh such that a1b1=⋯=ahbh, p≥2 and q≥3.