A note on extremal Sombor indices of trees with a given degree sequence
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910450093916160 |
|---|---|
| author | Damnjanović, Ivan Milošević, Marko Stevanović, Dragan |
| author_facet | Damnjanović, Ivan Milošević, Marko Stevanović, Dragan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_11920 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A note on extremal Sombor indices of trees with a given degree sequence Damnjanović, Ivan Milošević, Marko Stevanović, Dragan Combinatorics 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. |
| title | A note on extremal Sombor indices of trees with a given degree sequence |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2211.11920 |