Abstract
The concept of geometric arithmetic indices (GA) was introduced in the chemical graph theory very recently. In this letter we compare the geometric arithmetic indices for chemical trees, starlike trees and general trees. Moreover, we give a conjecture for general graphs.
Highlights
Let G = (V, E) denote a simple graph with n vertices and m edges, V(G) = {1, 2, ..., n} and m = |E(G)|.1 let di be the degree of the vertex i for i = 1, 2,..., n
Where Qi is some quantity that in a unique manner can be associated with the vertex i of the graph G
The first member of this class was considered by Vukičević and Furtula2 by setting Qi to be the degree di of the vertex i of the graph G:
Summary
Let G = (V, E) denote a simple graph with n vertices and m edges, V(G) = {1, 2, ..., n} and m = |E(G)|.1 let di be the degree of the vertex i for i = 1, 2,..., n. The first member of this class was considered by Vukičević and Furtula2 by setting Qi to be the degree di of the vertex i of the graph G: The second member of this class was considered by Fath-Tabar et al.3 by setting Qi to be the number ni of vertices of G lying closer to the vertex i than to the vertex j for the edge ij of the graph G: Let x be a vertex and ij be an edge of the graph G.
Sign-in/Register to view highlights & summary 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 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.
