Abstract

Let G = (V,E), V = {1,2 … n}, be a simple connected graph with n vertices and m edges and let d1 ≥ d2 … ≥ dn > 0, be the sequence of vertex degrees. With i ~ j we denote the adjacency of the vertices i and j in graph G. With AG = Σi~j di+dj 2 p didj we denote arithmetic-geometric topological index. In this paper we give some new upper bounds for this topological index.

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

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.