More on Sombor Index of Graphs

: Recently, a novel degree-based molecular structure descriptor, called Sombor index was introduced. Let G = ( V ( G ) , E ( G )) be a graph. Then, the Sombor index of G is deﬁned as


Introduction
In this paper, we only consider simple undirected graphs.Let G = (V(G), E(G)) be a graph with n vertices and m edges.If m = n + k − 1, then G is called a k-cyclic graph.A 1-cyclic graph is usually called a unicyclic graph.The complement G c of G is the graph with the vertex set V(G), and xy ∈ E(G c ) ⇔ xy ∈ E(G).The degree of a vertex v in G, denoted by d G (v), is the number of edges incident with v.A vertex of degree one is called a pendant vertex of G, while the edge incident with a pendant vertex is known as a pendant edge.The vertex adjacent to a pendant vertex is usually called a support vertex.To subdivide an edge e is to delete e, add a new vertex x, and join x to the end-vertices of e. Suppose D ⊆ E(G).Then, denote by G − D the graph obtained from G by deleting all the elements in D. If D = {e}, we write G − e for G − {e} for simplicity.For a connected graph G, if G − e is disconnected, then e is called a cut edge.If D ⊆ E(G c ), denote by G + D the graph obtained from G by adding all of elements in D to the graph G.
A graph invariant is a numerical quantity which is invariant under graph isomorphism.It is usually referred to as a topological index in chemical graph theory.It is shown that some topological indices can be used to reflect physico-chemical and biological properties of molecules in quantitative structure-activity relationship (QSAR) and quantitative structureproperty relationship (QSPR) studies [1][2][3].Among various topological indices, degree-based and distance-based topological indices have been extensively investigated (see in [4][5][6][7]).
In 2021, a novel degree-based topological index was introduced by I. Gutman in [8], called the Sombor index.It was inspired by the geometric interpretation of degree-radii of the edges and defined as for a graph G. I. Gutman [8] also defined the reduced Sombor index as Later, K. C. Das et al. [9] proposed the following index: We name it as the increased Sombor index in this paper.
Recently, the Sombor index has received a lot of attention within mathematics and chemistry.For example, the chemical applicability of the Sombor index, especially the predictive and discriminative potentials was investigated in [10,11].The results indicate that the Sombor index may be successfully applied for the modeling of thermodynamic properties of compounds and confirm the suitability of this new index in QSPR analysis.For more chemical applications, the readers may see in [12][13][14] for reference.K. C. Das et al. [15,16] obtained some lower and upper bounds on SO in terms of graph parameters.They also presented some relations between SO and the Zagreb indices.The relations between SO and other degree-based indices were examined in [17].Graphs having maximum Sombor index among all connected k-cyclic graphs of order n, where 1 ≤ k ≤ n − 2, were investigated in [9,18].R. Cruz et al. [19] characterized the extremal graphs with respect to SO over all (connected) chemical graphs, chemical trees, and hexagonal systems.H. Liu [20] determined the extremal graphs with maximum SO among all cacti with fixed number of cycles and perfect matchings.N. Ghanbari et al. [21] studied this index for certain graphs and also examined the effects on SO(G) when G is modified by operations on vertex and edge of G. Inspired by these works, we establish some new extremal results of the Sombor index.
Recall that a connected graph is a cactus if any two of its cycles have at most one common and S n be the path, cycle and the star with n vertices, respectively.This paper is organized as follows.In Section 2, some lemmas are introduced to compare the Sombor indices between two graphs.As applications, in Section 3, the unique graph with maximum SO among all cacti with n vertices and k cut edges is determined.Furthermore, the unique graph with maximum SO among all cacti with n vertices and p pendant vertices is characterized.In Section 4, we present the minimum and maximum SO of quasi-unicyclic graphs.

Preliminaries
For convenience, let f (x, y) = x 2 + y 2 , where x, y ≥ 1.For f (x, y), we have the following result.
Lemma 1 ([20,22]).Let h(x, y) be defined for x ≥ 1, y ≥ 1 as Then, for any value of y ≥ 1, h is increasing as a function of x; for any value of x ≥ 1, h is decreasing as a function of y.

Lemma 2 ([23]
).Let P and Q be two pendant paths with origins u and v in graph G, respectively.Let x be a neighbor vertex of u who lies on P and y be the pendant vertex on Q. Denote G = (G − ux) + xy.Then, SO(G) > SO(G ).Now, we introduce some new transformations which increase the Sombor index of a graph.Lemma 3. Let G be a graph and e = uv an edge of G with N G (u) ∩ N G (v) = ∅.Let G be the graph obtained from G by first deleting the edge e and identifying u with v, and then attaching a pendant vertex w to the common vertex (see Figure 1).If d G (u) ≥ 2 and d G (v) ≥ 2, then SO(G) < SO(G ).Proof of Lemma 3.
Lemma 4. Let G be a graph and G u,v (p, q) the graph obtained from G by attaching p and q pendant edges to u and v, respectively, where u, v ∈ V(G) and p ≥ q ≥ 1.
Proof of Lemma 4. If uv ∈ E(G), then by Lemma 1, Lemma 6.Let G be a graph and Remark 1.By the definitions of SO and SO ‡ , it is easy to see that Lemmas 3-6 also hold if we replace SO with SO ‡ in these lemmas.
By Remark 1, we easily get the following result which will be used later.

Sombor Index of Cacti
Denote by C k n the set of all cacti of order n with k cut edges, and C(n, p) the set of all cacti of order n with p pendant vertices.Then, 0 ≤ k ≤ n − 1 and k = n − 2. In this section, we investigate the maximal values of the Sombor index over the sets C k n and C(n, p).Given two integers k and n with 0 ≤ k ≤ n − 1 and k = n − 2, if n − k is even, denote by G 1 the graph obtained from a star S n−1 by first adding n−k−2 2 new edges between its pendant vertices such that no two of the new edges are adjacent, and then subdividing one new edge; if n − k is odd, denote by G 2 the graph obtained from a star S n by adding n−k−1 2 new edges between its pendant vertices such that no two of the new edges are adjacent (see Figure 2).
The following theorem shows that the graph S n has maximum Sombor index over C n−1 n .Therefore, we assume k = n − 1 in the following.

Theorem 2 ([8]
).For any tree T of order n, Equality holds if and only if T ∼ = P n or T ∼ = S n .
Theorem 3.For graphs in C k n , where 0 ≤ k ≤ n − 3, (1) if n − k is even, G 1 is the unique graph with maximum Sombor index; (2) if n − k is odd, G 2 is the unique graph with maximum Sombor index, where G 1 and G 2 are depicted in Figure 2.
Proof of Theorem 3. Let G be the graph with maximum Sombor index in C k n .By Lemma 3, each cut edge of G is pendant.We show that the following propositions hold for G.
a contradiction to the choice of G. Therefore, Proposition 1 holds.Proposition 2. Each 4-cycle has at most one vertex of degree larger than 2 in G.
Proof of Proposition 2. Suppose there is a 4-cycle C = v 1 v 2 v 3 v 4 v 1 containing at least two vertices of degree larger than 2. Since G has maximum Sombor index, any two vertices of C with degree larger than 2 must be adjacent by Lemma 5. Thus, C contains exactly two adjacent vertices of degree 2. Without loss of generality, we assume that > 0, a contradiction.By Lemma 6, each 3-cycle has at most one vertex of degree larger than 2. Combining it with Propositions 1 and 2, G is obtained from s copies of C 4 and t copies of C 3 by first taking one vertex of each of them and fusing them together into a new common vertex v, and then attaching k pendant vertices at v, where 3s + 2t + k + 1 = n.Suppose s ≥ 2.Then, there are at least two 4-cycles Next, we find the maximal graph with respect to the Sombor index among C(n, p) with n vertices and p pendant vertices.As S n−1 is the only graph with n − 1 pendant vertices, we assume 0 ≤ p ≤ n − 2 in the following.Before we give our main result, we show a lemma.
Proof of Lemma 7. By direct calculation, we get We denote the right side of equation (1) by A. Then, by Lemma 1, )] > 0 by Lemma 1, which completes the proof.Denote by DS p,q the double star obtained from a star S p+2 by attaching q pendant vertices to one pendant vertex.Then DS p,q has n = p + q + 2 vertices.Theorem 4. For graphs in C(n, p), where 0 ≤ p ≤ n − 2 and n ≥ 5, (1) if p = n − 2, DS n−3,1 is the unique graph with maximum Sombor index; (2) if p ≤ n − 3 and n − p is even, G 1 is the unique graph with maximum Sombor index; (3) if p ≤ n − 3 and n − k is odd, G 2 is the unique graph with maximum Sombor index, where G 1 and G 2 are depicted in Figure 2.
Proof of Theorem 4. If p = n − 2, then any graph in C(n, p) is a double star.By Lemma 4, DS n−3,1 is the unique graph with maximum Sombor index.Now suppose p ≤ n − 3. Let G be the graph with maximum Sombor index in C(n, p).Then, the following claims hold.

Claim 1. G must contain a cycle.
Proof of Claim 1. Suppose not.Then, G is a tree.As p ≤ n − 3, there are two nonpendant vertices u and v of G with uv ∈ E(G).Let G = G + uv.Then, G ∈ C(n, p) and SO(G ) > SO(G), a contradiction to the choice of G.
By the same argument as that of Theorem 3, each cycle in G is of length 3 or 4.Moreover, each cycle of G has at most one vertex of degree larger than 2. Let T be the graph obtained from G by deleting all vertices of degree 2 in each cycle.Then, T is a tree.Let d(T) be the diameter of T. Proof of Claim 3. Suppose there are two cycles C 1 and C 2 such that the length of the path P connecting them is larger than 1.
and SO(G ) > SO(G), a contradiction, which implies Claim 3 holds.

Claim 4. Any two cycles of G have one common vertex.
Proof of Claim 4. Suppose there are two cycles C 1 and C 2 having no vertices in common.
Then by Claim 3, the length of the path P connecting them is 1.Suppose P = u 1 v 1 , where We show that for each vertex w ∈ (N G (u ).Let G be obtained from G by first deleting the edge u 1 v 1 and identifying u 1 with v 1 , and then subdividing the edge u 1 u 2 .Then G ∈ C(n, p) and SO(G ) > SO(G) by Lemma 7, a contradiction.Therefore, Claim 4 holds.Claim 5.All pendant vertices in G are adjacent to u, where u is the common vertex of all cycles in G.
Proof of Claim 5. Suppose there is a support vertex Then by Claim 1, there are at least two vertices of degree 2 adjacent to Denote by G the graph obtained from G by first deleting the edge uv and identifying u with v, and then subdividing the edge uu 1 .Then G ∈ C(n, p) and SO(G ) > SO(G) by Lemma 7, a contradiction.Therefore, we may assume that there is a vertex This completes the proof of Claim 5.
By the same argument as that of Theorem 3, there is at most one 4-cycle in G. Therefore, G is obtained from s copies of C 4 and t copies of C 3 by first taking one vertex of each of them and fusing them together into a new common vertex u, and then attaching p pendant vertices at u, where 3s + 2t + p + 1 = n and 0 ≤ s ≤ 1.Therefore, s = 1 if n − p is even and s = 0 otherwise, i.e., G ∼ = G 1 if n − p is even and G ∼ = G 2 otherwise.

Sombor Index of Quasi-Unicyclic Graphs
Let QU (n) be the set of all quasi-unicyclic graphs of order n.Denote by ∞(p, l, q) the graph obtained from two cycles C p and C q by connecting a vertex u ∈ V(C p ) and a vertex v ∈ V(C q ) by a path v 0 v 1 • • • v l of length l (identifying u with v if l = 0), where v 0 = u, v l = v and p + q + l = n + 1.Let Θ(s, t, r) be a union of three paths P s+1 , P t+1 , P r+1 resp.with common end vertices, where s + t + r + 1 = n, s ≥ t ≥ r ≥ 1 and at most one of them is 1.
Theorem 5. Let G ∈ QU (n) be the graph with minimum Sombor index, where n ≥ 4. Then G ∼ = Θ(s, t, 1) or ∞(p, 1, q), and SO(G) = (2n Proof of Theorem 5. We first show that H has at most two pendant vertices.Suppose H has at least three pendant vertices.If max{d H (v 1 ), d H (v 2 )} ≥ 2, then G has at least two pendant paths, say Then, G ∈ QU (n) and SO(G ) < SO(G) by Lemma 2, a contradiction.Therefore, we may assume that d H (v 1 ) = d H (v 2 ) = 1.Then, there is a pendant path This contradicts to the definition of G. Therefore, there are at most two pendant vertices in H. Now, we show that every pendant vertex in H is adjacent to v n in G. Suppose there is a pendant vertex v in H with v ∈ {v 1 , v 2 }.Then there is one vertex in {v 1 , < 0, a contradiction.From the above, G is a bicyclic graph with no pendant vertices.i.e., G ∼ = Θ(s, t, r) or ∞(p, l, q).By direct calculation, we have SO(Θ(s, t, r)) = (n − 5) f (2, 2) Here, we recall some theory of majorization.
A subset X ⊆ R n is a convex set if for any x, y ∈ X and any λ with 0 < λ < 1, λx + (1 − λ)y ∈ X.Let X ⊆ R n be a convex set.For a function f : X → R, if for any x, y ∈ X and any λ with 0 < λ < 1, f (λx + (1 − λ)y) ≤ λ f (x) + (1 − λ) f (y), then f is called a convex function.If the inequality above is strict for all x, y ∈ X with x = y, then f is a strictly convex function.Let I be an interval and f : I → R be a real twice-differentiable function on I, then it is well-known that f is convex if and only if f (x) ≥ 0 for all x ∈ I, and f is strictly convex if f (x) > 0 for all x ∈ I.
For each vector x = (x 1 , x 2 , . . ., x n ) ∈ R n , consider the decreasing rearrangement of it, i.e., we always assume that Then we have the following definition and majorization inequality.
When x ≺ y, x is said to be majorized by y (y majorizes x).

Lemma 8 ([25]
).Let I ⊆ R be an interval and f : By the definition of the Sombor index, we get Moreover, the equality holds if and only if G ∼ = C 3 (n − 4, 0, 0) ∨ K 1 .

Conclusions
As graph invariants, topological indices are used for QSAR and QSPR studies.Therefore, it is very important to study the extremal graphs with respect to topological indices in chemical graph theory.Until now, many topological indices have been introduced and several of them have been found various applications.As a novel index, the Sombor index has received a lot of attention within mathematics and chemistry.In this paper, we give some transformations to compare the Sombor indices between two graphs.With these transformations, we present the maximum Sombor index among cacti C k n and C(n, p).Moreover, the maximum and minimum Sombor index among all quasi-unicyclic graphs are characterized.It is interesting to consider the minimum Sombor index of cacti with some graph parameters.We will consider it for future study.
Then, P is called a pendant path in G and u is called the origin of P. In [23], B. Horoldagva et al. showed the following transformation.

Figure 1 .
Figure 1.Graphs G and G .

Theorem 1 .
Let G be the graph with maximum increased Sombor index among all unicyclic graphs of order n.Then G ∼ = C 3 (n − 3, 0, 0), where C 3 (n − 3, 0, 0) is obtained from a 3-cycle C 3 by attaching n − 3 pendant vertices to one vertex of C 3 .Proof of Theorem 1.By considering the version of SO ‡ of Lemma 3, each cut edge of G is pendant and the girth of G is 3.Moreover, all pendant vertices are adjacent to one common vertex by Lemma 6.Therefore, G ∼ = C 3 (n − 3, 0, 0).

Claim 2 .Claim 3 .
d(T) ≤ 3. Proof of Claim 2. Suppose d(T) ≥ 4. Then there are two non-pendant vertices u and v of T with uv ∈ E(T).Let G = G + uv.Then G ∈ C(n, p) and SO(G ) > SO(G), a contradiction, which implies Claim 2 holds.Similarly, we have For any two cycles C 1 and C 2 in G, the length of the path connecting them is 0 or 1.