Proof of a conjecture on Sombor index
نویسندگان
1 Department of Mathematics, Tafresh University, Tafresh 39518-79611, I. R. Iran
2 Department of Mathematics, Savitribai Phule Pune University, Pune-411007, India.
doi
10.22061/jdma.2025.11904.1126چکیده
Let $G$ be a simple graph. In this paper we prove the stated conjecture in [Some notes on Sombor index of graphs, MATCH Commun. Math. Comput. Chem.93 (2025) 853-859] and state an upper bound for the Sombor index of $G$ in terms of its size and the smallest eigenvalue of its Sombor matrix. Also, characterize all graphs for which the specified bound is attained.
