References

Let G be a graph. The Wiener index of G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is the set of all vertices of G and for x,y ∈ V(G), d(x,y) denotes the length of a minimal path between x and y. The Padmakar–Ivan (PI) index of G is defined as PI(G) = ∑[neu(e|G)+ nev(e|G)], where neu(e|G) is the number of edges of G lying closer to u than to v, nev(e|G) is the number of edges of G lying closer to v than to u and summation goes over all edges of G. Let e be an edge of G, N1(e|G) be the number of vertices of G lying closer to one end of e and N2(e|G) be the number of vertices of G lying closer to the other end of e. Then the szeged index of the graph G is defined as Sz(G) = ∑e∈E(G)N1(e|G)N2(e|G), where E(G) is the set of all edges of G. In this talk we present our recent works on computing Wiener, PI and Szeged indices o