On the minimum Sombor index of trees with a given independence number
Bojana Borovićanin, Dragana Božović, Edin Glogić, Daša Mesarič Štesl, Simon Špacapan, Emir Zogić
Source record
Source: Crossref
Published: Feb 20, 2026
DOI: 10.1142/s1793557126500191
Open original source ↗Source abstract
The Sombor index of a graph [Formula: see text], introduced by Gutman in 2021, is a topological index based on vertex degrees. It is defined by [Formula: see text] where [Formula: see text] and [Formula: see text] denote the degrees of the end-vertices of edge [Formula: see text]. In this paper we provide a lower bound for the Sombor index of trees with a given independence number [Formula: see text] and order [Formula: see text], and characterize trees that achieve this bound. This study contributes to ongoing research on the extremal properties of the Sombor index and its relation to other graph parameters.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.