Answers are grounded in this paper and cite their sources.
Theoretical analysis reveals sharp inequalities for the diminished Sombor index in simple graphs, highlighting key relationships with standard degree-based network parameters.
The diminished Sombor index of a simple graph [Formula: see text] is defined by [Formula: see text] where [Formula: see text] and [Formula: see text] denote the degrees of the vertices [Formula: see text] and [Formula: see text], respectively. In this paper, we study the diminished Sombor index and develop a suite of sharp inequalities connecting it to standard graph parameters (order, size, minimum/maximum degree) and classical degree-based indices.
No takes yet. Share an insight, caveat, or question.
Mohammad Hadi Akhbari (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: