Proof of an open problem on the Sombor index

The Sombor index is one of the geometry-based descriptors, which was defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{d^{2}(u)+d^{2}(v)},$ where $d(u)$ (resp. $d(v)$) denotes the degree of vertex $u$ (resp. $v$) in $G$. In this note, we determine the maximum and minimum graphs with respect to the Sombor index among the set of graphs with vertex connectivity (resp. edge connectivity) at most $k$, which solves an open problem on the Sombor index proposed by Hayat and Rehman [On Sombor index of graphs with a given number of cut-vertices, MATCH Commun. Math. Comput. Chem. 89 (2023) 437--450]. For some of the conclusions of the above paper, we give some counterexamples. At last, we give the QSPR analysis with regression modeling and Sombor index.

No reviews yet.

No comments yet.