On extremal Sombor index of trees with a given dissociation number
Abstract
The Sombor index is a topological index in graph theory defined by Gutman in 2021. In this article, we find the maximum Sombor index of trees of order n with a given dissociation number , where *2n3 ≤ (G) ≤ n-1. We also provide the unique graph among the chosen class where the maximum Sombor index is attained.
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.