论文信息 - A Class of Trees and its Wiener Index

A Class of Trees and its Wiener Index

In this paper, we will consider the Wiener index for a class of trees that is connected to partitions of integers. Our main theorem is the fact that every integer $$\geq 470$$ is the Wiener index of a member of this class. As a consequence, this proves a conjecture of Lepović and Gutman. The paper also contains extremal and average results on the Wiener index of the studied class.

Stephan Wagner

[1] Douglas J. Klein,et al. Partial Orderings in Chemistry , 1997, J. Chem. Inf. Comput. Sci..

[2] Reinhard Diestel,et al. Graph Theory , 1997 .

[3] Hans Rademacher,et al. On the Expansion of the Partition Function in a Series , 1943 .

[4] D. J. Newman,et al. A simplified proof of the partition formula. , 1962 .

[5] I. Kessler,et al. The expected number of parts in a partition ofn , 1976 .

[6] Ivan Gutman,et al. A Collective Property of Trees and Chemical Trees , 1998, J. Chem. Inf. Comput. Sci..

[7] Arnold Knopfmacher,et al. Graphs, partitions and Fibonacci numbers , 2007, Discret. Appl. Math..

[8] I. Gutman,et al. Wiener Index of Trees: Theory and Applications , 2001 .