The Wiener Index W of a graph is most often calculated by numerical methods. In this paper a method is proposed to deduce analytical formulas for W and for the connectedness index. It is shown that expressions for W can not include fourth or higher order terms in the number of vertices of the constituent strings. Formulas have been derived for graphs containing one, two, and three strings, and the general rules based on these formulas are discussed. Several numerical examples are given.
|Number of pages||5|
|Journal||Journal of Chemical Information and Computer Sciences|
|Publication status||Published - Nov 1 1991|
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics