A Few Results on Wiener Index of the kth Power of Some Specific Graphs
K. R. Udaya Kumar Reddy · Journal of Scientific Research and Reports · 2015
For a simple connected undirected graph G = (V;E), the Wiener index W(G) of G is defined as half the sum of the shortest-path distances between all pairs of vertices u; v of G. The kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such that two verti...
Open access
Research Article
10.9734/JSRR/2015/14639