Maximum Estrada index of bicyclic graphs

From MaRDI portal
Publication:476327

DOI10.1016/J.DAM.2014.08.010zbMATH Open1303.05121arXiv1204.3686OpenAlexW2061067020MaRDI QIDQ476327FDOQ476327


Authors: Yizheng Fan, Long Wang, Yi Wang Edit this on Wikidata


Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1204.3686




Recommendations




Cites Work


Cited In (19)





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)