Abstract
Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.
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
