Maximum Estrada index of bicyclic graphs

From MaRDI portal
(Redirected from Publication:476327)




Abstract: Let G be a simple graph of order n, let lambda1(G),lambda2(G),...,lambdan(G) be the eigenvalues of the adjacency matrix of G. The Esrada index of G is defined as EE(G)=sumi=1nelambdai(G). In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.









This page was built for publication: Maximum Estrada index of bicyclic graphs

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