On Reciprocal Complementary Wiener Index of a Graph

The eccentricity of a vertex v of graph G is the largest distance between and any other vertex of a graph . The reciprocal complementary Wiener RCW (G)= Σ 1≤i≤j≤n 1/1+D-d (vi,vj), index of is defined as, , where D is the diameter of G and d (vi,vj) is the distance between the vertices vi and vj In this paper we have obtained bounds for the PCW index in terms of eccentricities and given an algorithm to compute the PCW index.