JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, vol.41, no.4, pp.1007-1024, 2020 (Peer-Reviewed Journal)
Let G = (V, E) be a simple connected graph, where V(G) and E(G) represent the vertex set and edge set of G respectively. The vertex set V(G) associates with the atoms and the edge set E(G) associates with the bonds of the atoms in a chemical graph. For a connected graph G, the second geometric-arithmetic index GA(v)(G) index is denoted as GA(1)(G) = Sigma(e=uv is an element of E(G)) 2 root d(u)xd(v)/d(u)+d(v), and the Mostar M-o(G) index of a graph G is formulated by GA(v)(G) = Sigma(e=uv is an element of E(G)) 2 root n(u)(e)xn(v)(e)/n(u)(e)+n(v)(e), where n(u)(e) is the number of vertices which are closer to the vertex u than to vertex v of e and n(v)(e) is the number of vertices which are closer to vertex v than to the vertex u of e. The aim of this paper is to calculate and compare the geometric-arithmetic GA(v)(G) index and Mostar M-o(G) index of P-2n+P-F(n+1).