arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.01216math.CO
收藏

具有给定权和度序列的顶点加权树的最小Wiener指标

Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences

Mikhail Goubko

摘要:

1997年,Klavžar和Gutman提出了Wiener指数到顶点加权图的推广。我们最小化维纳指数的树的集合与给定的顶点权重和度的序列,并显示一个最优的树是,所谓的,霍夫曼树建立在一个自底向上的方式,通过顺序连接顶点的最小权重。

英文摘要:

In 1997 Klavžar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be the, so-called, Huffman tree built in a bottom-up manner by sequentially connecting vertices of the least weights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑