论文标题
最小加权的索引树
Minimum Weighted Szeged Index Trees
论文作者
论文摘要
加权Szeged指数是最近引入的众所周知的Szeged指数的扩展。在本文中，我们提出了一种新工具来分析和表征最小加权的索引树。我们展示了最多有81个顶点的最好的树木，并将这些信息与我们的结果一起提出了关于最小加权szeged索引树结构的各种猜想。
Weighted Szeged index is a recently introduced extension of the well-known Szeged index. In this paper, we present a new tool to analyze and characterize minimum weighted Szeged index trees. We exhibit the best trees with up to 81 vertices and use this information, together with our results, to propose various conjectures on the structure of minimum weighted Szeged index trees.
