A note on extremal Sombor indices of trees with a given degree sequence
Ivan Damnjanović, Marko Milošević, Dragan Stevanović
Abstract
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.