Abstract
Let G be a simple graph of order n, let λ1(G),λ2(G),…,λn(G) be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G)=∑i=1neλi(G). In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
