On the modified Wiener Index

چکیده مقاله

Throughout this paper graph means simple graph. Suppose G is such a graph with vertex set G. The distance between vertices u, v in V(G) is denoted by d(u,v) and it is defined as the number of edges in a shortest path connecting them. The Wiener index, W(G) equals the sum of distances between all pairs of vertices in G [6].