• ON THE HYPER-WIENER INDEX OF TREES
Abstract
Let G be the connected graph. The Wiener index is the sum of all distances between vertices of G, whereas the hyper-Wiener index is defined as . In this paper we prove some general results on the hyper-Wiener index of trees and some bounds on it.
Keywords
Let G be the connected graph. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=W(G)+1/2 ∑_({u,v}⊆V{G})▒〖d(u,v)〗^2 . In this paper we prove some general results on the hyper-W
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |