论文标题
最大程度地减少固定度序列的树木中的Sombor指数
Minimizing the Sombor Index among Trees with Fixed Degree Sequence
论文作者
论文摘要
基于顶点学位的拓扑指数最近引起了数学化学家的很多关注。我们在本文中重点关注的一个索引称为Sombor指数。在2020年末定义后，Sombor指数很快被公认为是一个有价值的研究主题。在本文中，我们部分回答了以固定度序列找到有关该指数的极端树的开放问题。特别是我们专注于下限，并继续表明，贪婪的树可以最大程度地减少给定度序列的Sombor指数。
Vertex-degree-based topological indices have recently gained a lot of attention from mathematical chemists. One such index that we focus on in this paper is called Sombor index. After its definition in late 2020, the Sombor index was quickly recognized as a valuable research topic. In this paper we partially answer the open question of finding the extremal trees with respect to this index for a fixed degree sequence. Particularly we focus on the lower bound and proceed to show that greedy tree minimizes the Sombor index for a given degree sequence.
