论文标题
关于特定度序列的树木的极端索伯索引的注释
A note on extremal Sombor indices of trees with a given degree sequence
论文作者
论文摘要
我们在这里注意到，确定具有给定度序列的树木的极端索引的最大值，适合[Cent的Hua Wang的结果框架。欧元。 J. Math。 12（2014）1656-1663]，这意味着贪婪的树具有最低的Sombor指数，而交替的贪婪树则具有最大的Sombor指数。
We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.
