All but 49 Numbers are Wiener Indices of Trees
- First Online:
- 96 Downloads
The Wiener index is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. A long standing conjecture on the Wiener index ([4, 5]) states that for any positive integer \(n\) (except numbers from a given 49 element set), one can find a tree with Wiener index \(n\). In this paper, we prove that every integer \(n>10^8\) is the Wiener index of some short caterpillar tree with at most six non-leaf vertices. The Wiener index conjecture for trees then follows from this and the computational results in  and .
Mathematics Subject Classification (2000)05C05
Key wordstrees Wiener index molecular graph
Unable to display preview. Download preview PDF.
- 2.Goldman, D., Istrail, S., Lancia, G., Piccolboni, A.: Algorithmic strategies in combinatorial chemistry. In: Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 275–284, (2000)Google Scholar
- 7.Ban, Y.A., Bespamyatnikh, S., Mustafa, N.H.: On a conjecture on Wiener indices in combinatorial chemistry. In: Proc. of the 9th International Computing and Combinatorics Conference ’03, pp. 509–518, 2003. (The journal version will appear in Algorithmica, 2004)Google Scholar