New Bounds on Sombor Index
Articles > Article · 2023
Authors: Ivan Gutman, Necla Kırcalı Gürsoy, Arif GÜRSOY, Alper Ülker
Communications in Combinatorics and Optimization, Journal Indexed in SCI Expanded, International, Scopus, 2023, vol 8, pp 305-311
DOI: 10.22049/CCO.2022.27600.1296
Summary
The Sombor index of the graph G is a degree based topological index, defined as SO = Puv∈E(G) pd2u + d2v, where du is the degree of the vertex u, and E(G) is the edge set of G. Bounds on SO are established in terms of graph energy, size of minimum vertex cover, matching number, and induced matching number.