A Relation between D-Index and Wiener Index for r-Regular Graphs

Abstract EN

For any two distinct vertices u and v in a connected graph G, let lPu,v=lP be the length of u−v path P and the D–distance between u and v of G is defined as: dDu,v=minplP+∑∀y∈VPdeg y, where the minimum is taken over all u−v paths P and the sum is taken over all vertices of u−v path P.

The D-index of G is defined as WDG=1/2∑∀v,u∈VGdDu,v.

In this paper, we found a general formula that links the Wiener index with D-index of a regular graph G.

Moreover, we obtained different formulas of many special irregular graphs.