GA2 INDEX OF SOME GRAPH OPERATIONS

Let G = (V, E) be a graph. For e = uv is an element of E(G), n(u)(e) is the number of vertices of G lying closer to u than to v and n(v)(e) is the number of vertices of G lying closer to v than u. The GA(2) index of G is defined as Sigma(uv is an element of E(G)) 2 root n(u)(e)n(v)(e)/n(u)(e)+n(v)(e) . We explore here some mathematical properties and present explicit formulas for this new index under several graph operations.