Formulas for the hyper-Wiener index of chains and trees which contain one trivalent or tetravalent branching vertex are derived. The formulas are polynomials in terms of the lengths of the strings that form a tree. It is shown that the polynomial related to an arbitrary tree cannot contain fifth or higher order terms. A method to derive formulas for more complicated cases is given. It is suggested that in order to derive structure-property relationships the hyper-Wiener index has to be divided by the third power of the number of vertices of a particular graph.
|Number of pages||3|
|Journal||Journal of Chemical Information and Computer Sciences|
|Publication status||Published - Sep 1 1994|
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics