| Abstract
| - Trees with minimal and maximal hyper-Wiener indices(WW) are determined: Among n-vertextrees,minimum and maximum WW is achieved for the star-graph(Sn) and the path-graph(Pn), respectively.SinceWW(Sn) is a quadraticpolynomial in n,, whereasWW(Pn) is a quarticpolynomial in n, the hyper-Wienerindices of all n-vertex trees assume values from arelatively narrow interval. Consequently, the hyper-Wiener index must have a very low isomer-discriminating power. Thisconclusion is corroborated by findinglarge families of trees, all members of which have equalWW-values.
|
