Abstract
The geometric‐arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end‐vertex degrees of edges of G. Similarly, the arithmetic‐geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a tree attaining the maximum value of the addition AG + GA or difference AG − GA of the AG and GA indices in the class of all n‐vertex molecular trees must contain at most one vertex of degree 2 and at most one vertex of degree 3, but not both, for every fixed integer n ≥ 11. In this paper, the aforementioned conjecture is p.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.