A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence

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...

Full description

Saved in:
Bibliographic Details
Published in:Match (Mülheim) 2023, Vol.90 (1), p.197-202
Main Authors: Damjanović, Ivan, Milošević, Marko, Stevanović, Dragan
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0340-6253
DOI:10.46793/match.90-1.197D