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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
