Answers are grounded in this paper and cite their sources.
Let \(G=(V,E)\) be a simple connected graph. The modified Sombor index denoted by \(mSo(G)\) is defined as mSo(G)=∑uv∈ E1√d²ᵤ+d²ᵥ, where \(d_v\) denotes the degree of vertex \(v\). In this paper we present extremal values of modified Sombor index over the set of trees and unicyclic graphs.
No takes yet. Share an insight, caveat, or question.
Kashyap et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: