On the Sombor index of trees with degree restrictions
Abstract
We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the Sombor index and the alternating greedy tree maximises it, we also provide a full characterisation of all trees that have those maximum or minimum values. Moreover, we compare trees with different degree sequences and deduce a few corollaries.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.