Abstract
Let G be a simple graph of order n. The resolvent Estrada index of G is defined as EEr = nΣi=1 (1- λi/(n-1)^-1, where λ1;λ2;...;λn are the eigenvalues of G. Formulas for computing EEr of the cycle Cn and the path Pn are derived. The precision of these approximations are shown to be excellent. We also examine the difference and relations between the Estrada index and the resolvent Estrada index of Cn and Pn.
Sign-in/Register to access full text options 
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 callMore From: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
Disclaimer: 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.
