A note lower bounds for the Estrada index

From MaRDI portal
Publication:2659210



Abstract: Let G be a graph on n vertices and lambda1,lambda2,ldots,lambdan 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 obtained 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'c index, maximum and minimum degree and diameter.












This page was built for publication: A note lower bounds for the Estrada index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659210)