Abstract
The resolvent Estrada index is an interesting issue of computational chemistry. It was conjectured by Gutman et al. that among all trees of order n, n ≤ l, the tree Pn(l) has the l-th minimal resolvent Estrada index, for l ≥ 2. In this paper, we calculate minimal resolvent Estrada indices of trees by computer search, and we obtained all trees of order up to 22 with 4th-minimal up to 27th-minimal resolvent Estrada indices. This confirms the above conjecture stated by Gutman et al. for all trees with order up to 22.
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: Journal of Computational and Theoretical Nanoscience
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.
