Abstract
Let G be a graph on n vertices and λ1,λ2,…,λn its eigenvalues. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. In this paper, we present some new lower bounds for the Estrada index of graphs and in particular of bipartite graphs that only depend on the number of vertices, the number of edges, Randić index, maximum and minimum degree and diameter.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
