On Sombor Index

: The concept of Sombor index ( SO ) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index SO : SO = SO ( G ) = ∑ v i v j ∈ E ( G ) (cid:113) d G ( v i ) 2 + d G ( v j ) 2 , where d G ( v i ) is the degree of vertex v i in G . Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the ﬁrst and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.


Introduction
Consider a simple graph G = (V, E) with vertex set V(G) = {v 1 , v 2 , . . . , v n } and edge set E = E(G), where |V(G)| = n is the number of vertices and |E(G)| = m is the number of edges. For i = 1, 2, . . . , n denote by d G (v i ) the degree of vertex v i . For v i ∈ V(G), let µ G (v i ) represent the average degree of the vertices adjacent to vertex v i . Let δ be the minimum vertex degree and ∆ be the maximum vertex degree. It is known that any vertex v of degree 1 is a pendant vertex. Pendant vertex is also called leaf. A pendant edge is the edge incident with a pendant vertex. We denote by v i v j ∈ E(G) when vertices v i and v j are adjacent.
In graph theory, a number that is invariant under graph automorphisms is referred to as a graphical invariant. It is often regarded as a structural invariant relevant to a graph. The term topological index is often reserved for graphical invariant in molecular graph theory. In the mathematical and chemical literature, several dozens of vertex-degree-based graph invariants (usually referred to as "topological indices") have been introduced and extensively studied. Their general formula is where F(x, y) is some function with the property F(x, y) = F(y, x).
, then TI is the first Zagreb index or the second Zagreb index of graph G, respectively, which are put forward in [1] by Gutman and Trinajstić. They studied the dependence of total π-electron energy related to molecular structure. Some further development can be found for example in [2]. Given a molecular graph G, we have the first Zagreb index M 1 (G) as Symmetry 2021, 13, 140 2 of 12 and the second Zagreb index M 2 (G) as Many fundamental mathematical properties such as lower and upper bounds involving other important graphical invariants can be bound in, e.g., [3][4][5][6][7][8][9][10][11][12][13][14][15]. More recent results are reported in [16][17][18][19][20][21][22][23][24][25]. Zagreb indices characterize the degree of branching in molecular carbon-atom skeleton and are regarded as powerful molecular structure-descriptors [26,27]. Gutman mentioned a list of topological indices (26 indices including two Zagreb indices) in [28]. In the same paper, Gutman presented a novel approach to the vertexdegree-based topological index of (molecular) graphs. For this we need the following definition: In the (2-dimensional) coordinate system, it pertains to a point called the degree-point (or d-point) of the edge v i v j ∈ E(G). The point with coordinates (y, x) is the dual-degree-point (or dd-point) of the edge v i v j ∈ E(G). The distance between the d-point (x, y) and the origin of the coordinate system is the degree-radius (or d-radius) of the edge v i v j ∈ E(G), denoted by r(x, y). Based on elementary geometry (using Euclidean metrics), we have r(x, y) = x 2 + y 2 . From this, we immediately see that a d-point and the corresponding dd-point have equal degree-radii. One can easily see that for any molecular graphs (d G (v) ≤ 4), two degree-points have equal degree-radii if and only if they coincide, that is, if and only if both have the same degree-coordinates. Unfortunately, this property is not valid for general graphs.
Since the function F(x, y) = x 2 + y 2 has not been used before in the theory of vertex-degree-based topological indices, from the above considerations motivated by the author in [28], introduce a new such index defined as and called the Sombor index. In the same paper, several mathematical properties have been discussed.
Given W ⊆ E(G), we denote by G − W the subgraph of G which is obtained by removing any edge within W. If W = {v i v j }, we will write G − v i v j instead of the subgraph G − W for ease of expression. For a pair of nonadjacent vertices v i and v j in G, we write G + v i v j for the graph obtained by adding the edge v i v j to G. Let G[S] be the induced subgraph of G by S ⊆ V(G). S is said to be an independent set of G if G[S] is formed by |S| isolated vertices. The number of vertices in the largest independent set is called the independence number of a given graph, which is denoted conventionally by α. If a graph on n vertices contains a clique of n − α vertices and the rest α vertices is a stable set, where every vertex within the clique is linked to every vertex in the stable set, then the graph is called a complete split graph and is denoted by CS(n, α), 1 ≤ α ≤ n − 1. Another interesting graph class is called (∆, δ)-semiregular bipartite graph, where G is a bipartite graph with a bipartition U and W. Here, each vertex v i in U admits constant degree ∆ while each vertex v j in W admits constant degree δ. Clearly, if ∆ = δ, G becomes regular. As usual, K n is a complete graph and K a, b with (a + b = n) is a complete bipartite graph over n vertices. We refer the reader to the book [29] for other standard graph theoretical notations.
The rest of the paper is organized as follows. In Section 2, we obtain some lower and upper bounds on SO(G) in terms of graph parameters. In Section 3, we present some relations between SO(G) and the Zagreb indices M 1 (G) and M 2 (G). In Section 4, we give some conclusions and future work.

Bounds on Sombor Index of Graphs
In this section, we give several lower and upper bounds on SO(G) building on some useful graph parameters. From the definition of Sombor index, the following result can be summarized.
First we give the uppper and lower bounds on SO(G) building on n, ∆ and δ. Theorem 1. Suppose that G is a graph over n vertices. If G has maximum degree ∆ and minimum degree δ, with equality (left and right) if and only if G becomes a regular graph.

Proof.
Recall that ∆ is the maximum degree of G and δ is the minimum degree of G. By employing the Handshaking lemma, we obtain

with equality holding (left and right) if and only if
It follows from the definition of the Sombor index, we obtain Moreover, the equality herein holds if and only if d G (v i ) = ∆ for any v i ∈ V(G), i.e., G is regular. Similarly, we get the lower bound on Sombor index and equality holds if and only if G becomes regular.
Since ∆ ≤ n − 1, we get the following corollary.

Corollary 1 ([28]
). Let G be a graph of order n. Then with equality if and only if G ∼ = K n .
For triangle-free graph G, we obtain an upper bound on SO(G) based on n, m, ∆ and δ. Theorem 2. Let G be a triangle-free graph of order n with m edges and maximum degree ∆, minimum degree δ. Then Then one can easily see that h(x) is an increasing function on n/2 ≤ x ≤ ∆ and a decreasing function on δ ≤ x ≤ n/2. Hence With the results obtained above, we derive Gutman [28] proved that the path P n gives the minimum value of Sombor index for any connected graph of order n. Therefore, the path P n gives the minimum value of Sombor index for any connected bipartite graph of order n. We now give an upper bound on the Sombor index of bipartite graphs. Theorem 3. Let G be a bipartite graph over n vertices. Then Proof. Let G be a bipartite graph of order n (n = p + q, p ≥ q) with two partite sets having p and q vertices, respectively. Since G is bipartite graph, by Lemma 1, we obtain SO(G) ≤ SO(K p,q ) with equality if and only if G ∼ = K p,q . Hence Let us consider a function Then Thus f (x) is a decreasing function on n 2 ≤ x ≤ n − 1, and hence The required inequality has been proved. Besides, the equality holds if and only if G ∼ = K n 2 , n 2 .
Next, we present an upper bound on SO(G) by using n and independence number α. Theorem 4. Let G be a connected graph of order n with independence number α. 2 with equality if and only if G ∼ = CS(n, α).
Proof. We obtain SO(CS(n, α)) = Since G has order n and independence number α, by Lemma 1, we obtain with equality if and only if G ∼ = CS(n, α).
We now offer an additional upper bound on SO(G) in terms of m, δ and M 1 (G).
Theorem 5. Let G be a graph of size m and minimum degree δ. Then where M 1 (G) is the first Zagreb index of graph G. Moreover, the equality holds if and only if G is a regular graph.

Proof. For any edge
Moreover, the above two inequalities are equalities if and only if G is a regular graph.
We give an upper bound on SO(G) + SO(G) by employing the number n only.
Theorem 6. Let G be a graph over n vertices. We have with equality if and only if G ∼ = K n or G ∼ = K n .

2
, we obtain Moreover, the equality holds if and only if d G (

Relation between Sombor Index with Zagreb Indices of Graphs
Topological indices in mathematical chemistry are well studied in the literature. In particular we have seen several mathematical and chemical properties on topological indices of graphs, some of them are very similar, but some of them are totally different. So it is natural to ask how two topological indices are related or to find some relations between two topological indices of graphs. In last 10 years several papers have been published on this topic in the literature, see [23,25,[30][31][32][33][34][35][36][37]. In this section we try to find some relations between Sombor index and the (first & second) Zagreb indices of graphs. For this we need the following result: a 1 , a 2 , . . . , a k and b 1 , b 2 , . . . , b k be real numbers so that there are constants s and t satisfying for any i, i = 1, 2, . . . , k we have s a i ≤ b i ≤ t a i . Then with equality if and only if for at least one i, 1 ≤ i ≤ k holds s a i = b i = t a i .
Next, we investigate the relation between Sombor index SO(G) and the first Zagreb index M 1 (G) of graph G. Theorem 7. Let G be a graph containing n vertices and m edges. The maximum degree is denoted by ∆ and its minimum degree is δ > 0. Then where M 1 (G) is the first Zagreb index of graph G. Moreover, the equality holds if and only if G is a regular graph.
Proof. One can easily see that Then we have Thus f (x) is an increasing function on x ≥ 1. Using the above results, we obtain For any edge v i v j ∈ E(G), one can easily check that with equality if and only if G is a regular graph.
that is, that is, by (5). The first part of the proof is done.
Suppose that equality holds in (3). Then all the above inequalities must be equalities. By Lemma 2, from the equality in (6), we obtain Moreover, from the equality in (5), we obtain that G is a regular graph.
Conversely, let G be an r-regualr graph. Then we have We now obtain another relation between Sombor index SO(G) and the second Zagreb index M 2 (G) of graph G. Theorem 8. Let G be a graph over n vertices. Suppose it has maximum degree ∆ and minimum degree δ > 0. We obtain where M 2 (G) is the second Zagreb index of graph G. Moreover, the equality holds in (7) if and only if G is a regular graph.
Let µ G (v i ) be the average degree of the adjacent vertices of vertex v i in G. Then From the definition of the average degree of vertex with equality holding if and only if d G (v i ) = δ for any v i ∈ V(G).
by (8). The first part of the proof is done.
Similarly, the proof of the Theorem 7, we conclude that the equality holds in (7) if and only if G is a regular graph.
The following inequality is due to Radon [39].

Lemma 3. (Radon's inequality)
If a k , x k > 0, p > 0, k ∈ {1, 2, . . . , r}, then the following inequality holds: We now present a relation between Sombor index SO(G) and the second Zagreb index M 2 (G). Theorem 9. Let G be a graph over n vertices. Suppose G has maximum degree ∆ and minimum degree δ > 0. We have with equality if and only if G is a bipartite semiregular graph or G is a regular graph.

Proof. For any edge
) and δ > 0, by (4), we obtain with equality if and only if in Lemma 3 and using the above result, we obtain The first part of the proof is done.
Suppose that equality holds in (9). Then all the above inequalities must be equalities. By Lemma 3, from the equality in (11), for any edges v i v j , v k v ∈ E(G), we obtain From the equality in (12), we obtain d G (v i ) = ∆, d G (v j ) = δ for any edge v i v j ∈ E(G), by (10). Using the above results, we conclude that G is a (∆, δ)-semiregular bipartite graph (when G is bipartite) or G is a regular graph (when G is non-bipartite).
Let G be a (∆, δ)-semiregular bipartite graph. Then The proof is then complete.

Conclusions
Topological indices are graph invariants and are used for quantitative structure -activity relationship (QSAR) and quantitative structure -property relationship (QSPR) studies. Many topological indices have been defined in the literature and several of them have found applications as a means to model physical, chemical, pharmaceutical, and other properties of molecules. Gutman introduced the SO index as a new topological index in mathematical chemistry. In this paper, we presented some upper and lower bounds on the SO index and characterized extremal graphs. Moreover, we obtained some relations between the Sombor index and the (first & second) Zagreb indices of graphs. The minimal and the maximal Sombor index (SO), in the case of unicyclic graphs and bicyclic graphs, remains an open problem. Motivation to better understand the Sombor index has been mentioned in the literature [28]. Finding the chemical applications of this Sombor index is an attractive task for the near future.