Abstract
Let G be a graph on n vertices and λ1,λ2,…,λn their eigenvalues. The Estrada index of G is defined as EE(G)=∑i=1neλi. In this paper, we obtain new upper and lower bounds on the Estrada Index of a given graph, considering numerical inequalities present in the literature.
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
