The hyper-Wiener index of the generalized hierarchical product of graphs
The hyper Wiener index of the connected graph G G is W W ( G ) = 1 2 ? { u , v } ? V ( G ) ( d ( u , v ) + d ( u , v ) 2 ) , where d(u,v) d ( u , v ) is the distance between the vertices u u and v v of G G . In this paper we compute the hyper-Wiener index of the generalized hierarchical product of two graphs and give some applications of this operation.
generalized hierarchical product hyper wiener index distance f f -sum f f f f f path