Resolvent Energy of Graphs
Abstract: The resolvent energy of a graph G of order n is defined as ER =∑(n − λi)-1, where λ1, λ2, . . . , λn are the eigenvalues of G. We establish a number of properties of ER. In particular, we establish lower and upper bounds for ER and characterize the trees, unicyclic, and bicyclic graphs with smallest and greatest ER.
engleski
2016
© All rights reserved
Keywords: Graph spectrum, energy of graphs, resolvent energy