This paper is concerned with the recently introduced Sombor index SO, defined as SO = SO(G) = Sigma(vkvl is an element of E(G)) root d(G)(v(k))(2) + d(G) (v(l))(2), where d(G) (v) is the degree of the vertex v of a graph G. We present bounds on SO of trees in terms of order, independence number, and number of pendent vertices, and characterize the extremal cases. In addition, analogous results for quasi-trees are established. (C) 2021 Elsevier Inc. All rights reserved.
TreeSombor indexQuasi-treeMajorizationIndependence numberCOMPARING ZAGREB INDEXESBOUNDS
NSTL
Elsevier
