All but 49 numbers are Wiener indices of trees

All but 49 numbers are Wiener indices of trees
复制标题

DOI:
10.1007/s10440-006-9037-2
复制
发表时间:
2006-05-01
影响因子:
1.6
通讯作者:
Yu, Guang
Yu, Guang
中科院分区:
数学4区
文献类型:
--
作者:
Wang, Hua;Yu, Guang

文献摘要

被引文献

相似文献

维纳指数是将化合物的分子图与实验收集的关于化合物特性的数据相关联的主要描述符之一。关于维纳指数的沿着猜想([4,5])指出,对于任何正整数n(除了来自给定的49个元素集合的数字),可以找到具有维纳指数n的树。本文证明了任意整数n > 10(8)是某个不超过6个非叶顶点的短毛毛虫树的Wiener指标。树的维纳指数猜想由此以及[ 7]和[ 5]中的计算结果得出。
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. Along 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 [ 7] and [ 5].