On Some Topological Indices Defined via the Modified Sombor Matrix

Let G be a simple graph with the vertex set V={v1,…,vn} and denote by dvi the degree of the vertex vi. The modified Sombor index of G is the addition of the numbers (dvi2+dvj2)−1/2 over all of the edges vivj of G. The modified Sombor matrix AMS(G) of G is the n by n matrix such that its (i,j)-entry is equal to (dvi2+dvj2)−1/2 when vi and vj are adjacent and 0 otherwise. The modified Sombor spectral radius of G is the largest number among all of the eigenvalues of AMS(G). The sum of the absolute eigenvalues of AMS(G) is known as the modified Sombor energy of G. Two graphs with the same modified Sombor energy are referred to as modified Sombor equienergetic graphs. In this article, several bounds for the modified Sombor index, the modified Sombor spectral radius, and the modified Sombor energy are found, and the corresponding extremal graphs are characterized. By using computer programs (Mathematica and AutographiX), it is found that there exists only one pair of the modified Sombor equienergetic chemical graphs of an order of at most seven. It is proven that the modified Sombor energy of every regular, complete multipartite graph is 2; this result gives a large class of the modified Sombor equienergetic graphs. The (linear, logarithmic, and quadratic) regression analyses of the modified Sombor index and the modified Sombor energy together with their classical versions are also performed for the boiling points of the chemical graphs of an order of at most seven.


Introduction
We consider only simple and undirected graphs. The graph theoretical terminologies used in this paper, without defining them here, can be found in the book [1]. A graph of the order n with a vertex set V(G) and an edge set E(G) is denoted by G(V, E), or simply by G, where V(G) = {v 1 , v 2 , . . . , v n }. The cardinality of E(G) is the size m of G. The degree of a vertex v in G is the number of edges incident with v and is denoted by d v . A regular graph is one in which each vertex has the same degree. The maximum and minimum degrees of G are denoted by ∆ and δ, respectively. A graph of the order n is also known as an n-vertex graph. K n , K a,b , and P n denote the n-vertex complete graph, the (a + b)-vertex complete bipartite graph, and the n-vertex path graph, respectively. Moreover, denote the complete multipartite graph by K n 1 ,n 2 ,...,n t , where t ≥ 3, and denote the complete split graph with the clique size ω and the independence number n − ω by CS(ω, n − ω). Let S + n be the graph formed by adding an edge to the star K 1,n−1 .
By a topological index, we mean a numerical quantity TI calculated from a graph such that TI remains unchanged under graph isomorphism. Topological indices have several uses in theoretical chemistry, especially in quantitative structure-activity relationship and quantitative structure-property relationship studies [2]. For a graph G, its degree-based topological indices φ [3][4][5] of the following form are known as bond incident degree indices [6]: For particular choices of φ d u ,d v , we obtain existing topological indices; for example, the arithmetic-geometric index [7] is obtained when φ d u ,d v = (d u + d v )(4d u d v ) −1/2 , the general Randić index [8] is recovered if φ d u ,d v = (d u d v ) α , (for α = −1/2, we obtain the classical Randić index R [9]), and the general Sombor index is deduced when α . From the general Sombor index, we obtain the recently introduced Sombor (SO) index [10] and the modified Sombor index m SO [11] by using α = 1/2 and α = −1/2, respectively. The basic properties of the Sombor index were given by Gutman [10]. Das et al. [12] presented novel bounds for the Sombor index and gave its relations with several other topological indices, such as the Zagreb indices. Cruz et al. [13] investigated the Sombor index for chemical graphs and characterized extremal graphs from the classes of chemical graphs, chemical trees, and hexagonal systems, with respect to this index. The chemical applicability of the Sombor index was investigated in [14,15]. Kulli and Gutman initiated the study of the modified Sombor index and gave its basic properties. Later, Huang and Liu [16] obtained several interesting properties and bounds of the modified Sombor index, and they found its relations with some other topological indices, such as the Randić index, the Harmonic index, the sum-connectivity index, and the geometric-arithmetic index.
The general adjacency matrix (for example, see [4]) associated with φ of G is a real symmetric matrix, defined by The set of all eigenvalues of A φ (G) is known as the general adjacency spectrum of G and is denoted by λ 1 (A φ (G)), . . . , λ n (A φ (G)), indexed in a non-increasing order, where λ 1 (A φ (G)) is known as the general adjacency spectral radius of G. If G is a connected non-trivial graph and φ d u ,d v > 0 for every edge uv ∈ E(G), then by the Perron-Frobenius theorem, λ 1 (A φ (G)) is unique, and its associated eigenvector has positive components. Moreover, in this case, the inequality |λ i (A φ (G))| ≤ λ 1 (A φ (G)) holds for every i ∈ {2, . . . , n − 1, n}. The energy of the graph G associated with the topological index φ is defined [17] as If φ d u ,d v = 1 for every edge uv ∈ E(G), then A φ (G) coincides with the much-studied adjacency matrix A(G), and E φ (G) is the classical graph energy [18] defined as E (G) = ∑ n i=1 |λ i |, where λ 1 , . . . , λ n are the eigenvalues of A(G), and the multiset consisting of these eigenvalues is known as the spectrum of G. The graph energy E (G) has its origin in theoretical chemistry and helps in approximating the π-electron energy of unsaturated hydrocarbons. There is a wealth of literature about graph energy and its related topics (for examples, see [19][20][21][22][23][24][25]). (1), the we obtain the Sombor matrix We denote each eigenvalue of A S (G) by µ i and order them as µ 1 ≥ · · · ≥ µ n . The multiset of all eigenvalues of A S (G) is known as the Sombor spectrum of G. The Sombor energy of G is defined by Two graphs with the same modified Sombor energy are referred to as modified Sombor equienergetic graphs. Various papers on the spectral properties of the Sombor matrix, involving Sombor eigenvalues, the Sombor spectral radius, Sombor energy, the Sombor Estrada index, the relation of energy with Sombor energy, and the Sombor index, have recently been published (for examples, see [22,[26][27][28][29][30][31][32][33][34][35]). The The multiset consisting of all of the eigenvalues ρ 1 , . . . , ρ n of A MS (G) is called the modified Sombor spectrum of G. We assume that ρ 1 ≥ · · · ≥ ρ n , where ρ 1 is called the modified Sombor spectral radius of G. The modified Sombor energy [16] is defined by Various properties concerning the modified Sombor matrix can be found in [16]. The chemical applicability of the Sombor indices, such as the predictive and discriminative potentials, was examined by [15]. The Sombor index, the reduced Sombor index, and the average Sombor index were used to model the entropy and enthalpy of vaporization of alkanes. Some linear models that use one of these indices as the only predictor showed satisfactory predictive potential. The performance of these models was improved with the introduction of other topological indices, such as the first Zagreb index as a second predictor. Among these three topological molecular descriptors, the reduced Sombor index showed the best performance. The results of testing the predictive potential of the Sombor indices indicate that these descriptors may be successfully applied to modeling the thermodynamic properties of compounds.
The bond incident degree indices and their corresponding matrices (weighted adjacency matrices) have their own significance. Some notable points regarding some weighted adjacency matrices are below:

•
The classical graph energy cannot be an odd integer (see [36]). • The arithmetic-geometric energy can be any positive integer greater than one (see [37]). • The modified Sombor energy of every regular complete multipartite is constant and equals √ 2 (see Corollary 1). • The modified Sombor spectral radius of every regular graph is constant and equals 1 √ 2 (see Proposition 2).
The remainder of this paper is organized as follows: In Section 2, we establish bounds on the modified Sombor index, the modified Sombor spectral radius, and the modified Sombor energy and determine all of the graphs that attain these bounds. In Section 3, by using computer programs (Mathematica and AutographiX), we find that there exists only one pair of the modified Sombor equienergetic chemical graphs of an order of at most seven. The (linear, logarithmic, and quadratic) regression analyses of the modified Sombor index and the modified Sombor energy together with their classical versions are also performed in Section 3 for the boiling points of chemical graphs of an order of at most seven.

Results Concerning the Modified Sombor Matrix
In this section, we give bounds on the modified Sombor index, the modified Sombor spectral radius, and the modified Sombor energy, and we characterize the graphs that attain these bounds.
Let σ 1 , . . . , σ n be singular values of a matrix M. The Frobenius norm of M is defined by Similarly, the Frobenius norm (see [16]) of the modified Sombor matrix A MS (G) is and "Tr" denotes the trace of a matrix. We note that the modified Sombor index can be expressed as a quadratic form of the modified Sombor matrix: where J is a matrix of all ones. Moreover, according to the Rayleigh-Ritz theorem [19], for a non-zero vector X, we have If G is an r-regular graph, then and it is well known that λ 1 ≤ ∆ (see Propositions 1.1.1 and 1.1.2 [19]) with equality if and only if G is regular. Thus, for regular graphs, we have because m = nr/2. From these observations, the next two results follow: Proposition 1. If G is a connected non-trivial graph of the order n, then with equality holding if and only G is regular.

Proposition 2.
The modified Sombor spectral radius of every regular non-trivial graph is The number of edges adjacent to an edge uv of a graph is called the edge degree of uv. Following Simić and Stanić [38], we say that a graph is edge-regular (same terminology is also used for a particular type of regular graph; for example, see [39]) if all its edges have the same edge degree. The following result gives an upper bound for m SO(G) in terms of the size m and the Frobenius norm of A MS (G).

Proposition 3. If G is a connected non-trivial graph of size m, then
with equality holding if and only G is edge-regular, where B is defined via (2).
Proof. By using the Cauchy-Schwarz inequality, we have with equality holding if and only if there exists a constant c such that the equation is a vertex of at least two degrees, and w 1 , w 2 ∈ V(G) are two of its neighbors, then the equation if and only if all of the neighbors of every vertex of G have the same degree; that is, G is an edge-regular graph.
The double star-type graph DS(n, a, b) is a tree obtained from the two-vertex complete graph K 2 by attaching a pendent vertex of each of the a copies of the three-vertex path graph P 3 to one end-vertex of K 2 and attaching a pendent vertex of each of the b copies of P 3 to its other end-vertex; see Figure 1 for the graph DS (16,3,4). A graph of the order n is said to be a chain graph CG(n) if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to set inclusion (see Figure 1).

DS(16, 3, 4)
CG(10)  Table 1 presents the numerical calculations of the modified Sombor index bounds obtained in Propositions 1 and 3 and the results obtained by Huang and Liu [16]. The following result gives a lower bound and an upper bound for the modified Sombor spectral radius. (2). If G is a non-trivial graph of the order n, then

Proposition 4. Let B be the topological index defined via
where the left equality sign holds if and only if |ρ 1 | = |ρ 2 | = · · · = |ρ n |. If G is connected, then the right equality in (4) holds if and only if G ∼ = K n .
Proof. The right-handed inequality in (4) has already been derived in Theorem 3.4 [16] but without identifying the graphs that attain equality. For the sake of completeness, we first give the proof of this inequality and then characterize the connected graphs that attain its equality sign. Applying the Cauchy-Schwarz inequality to the vector (ρ 2 , ρ 3 , . . . , ρ n ), we have which implies that Suppose equality holds in (6). Then, equality holds in (5), which is possible if and only if ρ 2 = ρ 3 = · · · = ρ n . That is, G has two distinct modified Sombor eigenvalues ρ 1 and ρ 2 . According to the proof of Proposition 1.3.3 of [40], the diameter of G must be one, which implies that G is K n . Conversely, if G ∼ = K n , then the modified Sombor spectrum of G is Thus, Recall that ρ 2 1 + ρ 2 2 + · · · + ρ 2 n = 2B, so we obtain 2B ≤ ρ 2 1 + ρ 2 1 + · · · + ρ 2 1 , which gives with equality holding if and only if |ρ 1 | = |ρ 2 | = · · · = |ρ n |.
From the equality case of the right-handed inequality of Proposition 4, Proposition 1.3.3 of [40], and Theorem 2.1 of [41], the next proposition follows: Proposition 5. Let G be a connected non-trivial graph. The graph G has only two distinct modified Sombor eigenvalues if and only if G is the complete graph.
The topological index B defined via (2) is repeatedly used in our results. We now establish some bounds on it and characterize the corresponding extremal graphs. Proposition 6. Let G be a connected non-trivial graph.
(i) If G has a size m, maximum degree ∆, and minimum degree δ, then where either of the two equalities holds if and only if G is regular.
(ii) If G has the order n and the modified Sombor spectral radius ρ 1 , then with equality holding if and only if G ∼ = K n . (iii) For t ≥ 1, if G is bipartite with exactly t positive modified Sombor eigenvalues, then with equality holding if and only if G is the complete bipartite graph.
In what follows, we prove Part (iii). Note that ρ 2 1 + ρ 2 2 + · · · + ρ 2 n = 2B. Since G has exactly t positive modified Sombor eigenvalues, and its modified Sombor is symmetric toward the origin, we obtain which implies that B ≥ tρ 2 1 , with equality if and only if t = 1; by Proposition 7, G is the complete bipartite graph.
for an r-regular graph G. Thus, for regular graphs, we have Moreover, from the definition of E MS (G), it follows that where the right-handed equality sign holds if and only if G has only one positive modified Sombor eigenvalue. From (7) and any lower bound on ρ 1 , we obtain another lower bound on E MS (G). For example, we derive two such lower bounds on E MS (G) in the following: From Proposition 1, it follows that with equality if and only if G is regular. Moreover, according to Proposition 4, we have with equality if and only if |ρ 1 | = |ρ 2 | = · · · = |ρ n |. Thus, from these two lower bounds on ρ 1 and from (7), the next two lower bounds on E MS follow Equality occurs in (8) if and only if G is regular and has exactly one positive modified Sombor eigenvalue. Recall that, for regular graphs, we have =A MS (G) = 1 r √ 2 A(G) and that the adjacency matrix A(G) has only one positive eigenvalue if and only if G is a complete multipartite graph (see Smith [42]). Thus, equality holds in (8) if and only if G is a regular complete multipartite graph. Moreover, equality holds in (9) if and only G has only one positive modified Sombor eigenvalue and |ρ 1 | = |ρ 2 | = · · · = |ρ n |; which means that G is n 2 K 2 when G is disconnected, and G is K 2 when G is connected. We summarize these observations in the following result. Theorem 1. Let G be a non-trivial graph of order n.
(i) It holds that with equality if and only if G is a regular complete multipartite graph. (ii) It holds that with equality if and only if G is n 2 K 2 when G is disconnected, and G is K 2 when G is connected.
Next, we have an immediate consequence of Theorem 1, which states that the modified Sombor energy of the regular complete multipartite graphs is constant (which implies that the equation E MS (G 1 ) = E MS (G 2 ) holds for every pair of nonisomorphic regular complete multipartite graphs G 1 and G 2 of the same order).

Corollary 1.
If G is a regular complete multipartite graph, then

Remark 1. If G is a connected graph, then
Thus, for connected graphs, the lower bound on ρ 1 given in Proposition 1 is better than the one given in Proposition 4.
Next, we give the McClelland-and the Koolen-Moulton-type bounds for the modified Sombor energy.

Theorem 2. (i)
If G is a graph of the order n, and B is the topological index defined via (2), then If G is connected, then equality holds if and only if G is either K n or G has three distinct modified Sombor eigenvalues: ρ 1 = 2( m SO(G)) n and two others with equal absolute values (ii) If G is without any isolated vertex, then with equality holding if and only if G ∼ = n 2 K 2 .
Proof. By applying the Cauchy-Schwartz inequality and then using the fact that where the inequality sign becomes an equality sign if and only if Clearly, the function F defined by is decreasing for x in the interval 2B n , √ 2B . From Proposition 1, it follows that with equality if and only if G ∼ = K n . Moreover, according to Remark 1, Thus, Equality holds in (11) if and only if all above equalities hold, i.e., G is regular with the modified Sombor spectrum satisfying: ρ 1 = 2( m SO(G)) n and |ρ 2 | = |ρ 3 | = · · · = |ρ n |. One possibility is that G has two distinct modified Sombor eigenvalues and, according to Proposition 5, G is the complete graph. Conversely, for G ∼ = K n , we have m SO( Therefore, equality holds if and only if either G ∼ = K n or G has three distinct modified Sombor eigenvalues: ρ 1 = 2( m SO(G)) n and the remaining modified Sombor eigenvalues are equal in absolute value This completes the proof of Part (i). Next, we prove Part (ii). Since G contains no isolated vertex, according to Proposition 4, we have (10)), and hence we have Note that the equation E MS (G) = √ 2nB holds if and only if ρ 1 = 2B n and |ρ 2 | = |ρ 3 | = · · · = |ρ n | = 2B n , which holds if and only if G ∼ = n 2 K 2 .
Our next upper bound on E MS is a consequence of a result credited to Filipovski and Jajcay [20].

Theorem 3. If G is a graph of the order n and t is a positive integer such that ρ t is positive, then
Proof. The proof is similar to that of Theorem 5 of [20], and hence it is omitted here.
The following result gives a lower bound on E MS in terms of the topological index B.

Theorem 4.
If G is a connected graph of the order n, where n ≥ 3, then with equality holding if and only if G is a complete bipartite graph.

Proof.
Since which is possible if and only if ρ 1 = −ρ n and ρ 2 = ρ 3 = · · · = ρ n−1 = 0. Thus, G has three distinct modified Sombor eigenvalues and hence, according to Proposition 1.3.3 of [40], the diameter of G must be two. Moreover, we note that the modified Sombor spectrum of G is symmetric toward the origin, so it is verified that G is bipartite (see Lemma 2.12 of [22] with equality if and only if G ∼ = K 2 .

Proof. From Theorem 4, it follows that
with equality if and only if G ∼ = K a,n−a . Moreover, since G has exactly one positive modified Sombor eigenvalue, Theorem 3 yields According to (14) and (15), we obtain which implies that Therefore, where the inequality sign becomes an equality sign if and only if G is K 2 .

Remark 2. By Theorem 2,
with equality if and only if G ∼ = n 2 K 2 . Moreover, Inequality (13) gives The inequality holds whenever n 2 (n − 2) > 4, (17) which holds for n ≥ 3. Thus, for the graphs that have only one positive modified Sombor eigenvalue, the bound (13) is better than the second bound given in Theorem 2.
The following result gives a lower bound on E MS in terms of ρ n and B.

Theorem 5.
If G is a connected non-trivial graph of the order n, then where the equality holds if and only if G is either the complete bipartite or the complete tripartite graph.
Proof. Since the trace of A MS (G) is zero, we have Thus, we obtain Equality holds in (19) if and only if ∑ 1≤i<j≤n−1 One such possibility is ρ 2 = ρ 3 = · · · = ρ n−1 = 0, and it follows that ρ 1 = −ρ n , since Tr(A MS (G)) = 0. This implies that the modified Sombor spectrum of G is symmetric toward its origin, i.e., G is bipartite, and, according to Proposition 7, G is the complete bipartite graph. Conversely, E MS (K a,n−a ) = 2ρ 1 = |ρ n | + ρ 2 1 . The second possibility is that the modified Sombor spectrum of G is ρ 1 , 0, 0, . . . , 0, 0 n−3 , −ρ n−1 , −ρ n , (20) and, in this case, Next, we show that the spectrum given in (20) is the modified Sombor spectrum of the complete tripartite graph. Let {u 1 , u 2 , . . . , u a , v 1 , v 2 , . . . , v b , w 1 , w 2 , . . . , w c } be the vertex labeling of the tripartite graph G ∼ = K a,b,c , (a + b + c = n). Under this labeling, and d w 1 = d w 2 = · · · = d w a = a + b = n − c, and the modified Sombor matrix of G can be written as where O is the zero matrix, and J is the matrix of all ones. For i = 2, 3 . . . , a; j = 2, 3, . . . , b; and k = 2, 3, . . . , c, consider the following vectors: Clearly, , . . . , 1 , . . . , 1 Similarly, X 1 , X 2 , . . . , X a−1 , Y 1 , Y 2 , . . . , Y b−1 , and Z 1 , Z 2 , . . . , Z c−1 are the eigenvectors corresponding to the eigenvalue 0. Thus, 0 is the modified Sombor eigenvalue of G with the multiplicity a + b + c − 3. The remaining three modified Sombor eigenvalues of G are the eigenvalues of the following equitable quotient matrix (see Section 2.3 of [40]) The determinant of above matrix is which is certainly positive. Moreover, since A Q has the positive determinant and Tr(A Q ) = 0, the matrix A Q has one positive eigenvalue ρ 1 (according to the Perron-Frobenius theorem) and two negative eigenvalues ρ n−1 , ρ n . Thus, the desired equality holds if and only if G is the complete tripartite graph.
The graph obtained from K ω and P l by adding an edge between any vertex of K ω and an end vertex of P l is denoted by PK ω,l is known as a path complete graph or kite graph. The pineapple graph P(ω, n − ω) is the graph obtained from K ω by attaching n − ω pendent vertices to any vertex of K ω . Tables 2 and 3 give the numerical values of the bounds on the modified Sombor energy obtained in the present article.
From Table 2, for graphs with one positive modified Sombor eigenvalue, Corollary 2 gives a better upper bound, and, for general graphs, Theorem 2 (i) (the Koolen-Moultontype bound) gives a better upper bound. From Table 3 and with computational experiments, we observe that Theorem 3.6 of Huang and Liu [16] gives a better lower bound for graphs with a large diameter. Alternatively, for graphs with few positive modified Sombor eigenvalues and a small diameter, along with large independence and clique numbers, other lower bounds in this article are better than that of Theorem 3.6 in [16]. Next, we determine an inequality between E MS , E , and E SO for the case of the path graph P n of order n, where n ≥ 4. For this, we need the following result: Lemma 1 ([44]). If U 1 and U 2 are square matrices of the order n, then with equality if and only if there exists an orthogonal matrix M, such that MU 1 and MU 2 are both positive semi-definite.

Proposition 8.
For n ≥ 4, if P n is the path graph with n vertices, then Proof. The modified Sombor matrix of P n can be written as We note that 1 20 4 Therefore, according to Lemma 1, we have Similarly, we have [2] , 0 [n−4] . Therefore, according to Lemma 1, we have Thus, we have

Modified Sombor Equienergetic Graphs and Chemical Applicability of the Modified Sombor Index/Energy
Two non-isomorphic graphs G 1 and G 2 of the order n that have the same energy/Sombor energy/modified Sombor energy are known as equienergetic graphs/Sombor equienergetic graphs/modified Sombor equienergetic graphs, respectively. By using computer programs (Mathematica and AutographiX), we found that there exists only one pair of Sombor equienergetic graphs and only one pair of modified Sombor equienergetic graphs among all chemical graphs of the order of at most seven. However, there are exactly three pairs of equienergetic graphs among all chemical graphs of the order of at most seven. Two pairs of equienergetic graphs, namely {C 4 , K 1,3 } and {G 3 , G 4 } (see Figure 2 and Table 4), are neither Sombor equienergetic graphs nor modified Sombor equienergetic graphs. This gives the insight that Sombor equienergetic graphs and modified Sombor equienergetic graphs are rare in comparison to equienergetic graphs. Table 4. Approximate values of the energy, Sombor energy, and modified Sombor energy of the graphs depicted in Figure 2. Next, we carry the (linear, logarithmic, and quadratic) regression analyses for the Sombor index, modified Sombor index, Sombor energy, and modified Sombor energy on the class of all chemical graphs of the order of at most 7 to check their predictive abilities for the case of boiling points. The data on the boiling points for the aforementioned chemical graphs are taken from [45], and the other parameters are calculated by AutographiX [46]. Table 5 gives the correlation of the boiling points (Bp) with each of the following topological indices: the Sombor index, Sombor energy, modified Sombor index, and modified Sombor energy.  Table 5 suggests that the modified Sombor index is better correlated with the boiling points than all of the other three considered topological indices. Moreover, the modified Sombor energy is the second-best predictor for the boiling points among the considered indices. The scattering of Bp (boiling points) with each of the topological indices m SO and E MS for the linear, logarithmic, and quadratic regressions along with the regression equations and R 2 (coefficient of determination), are shown in Figure 3.   Table 6 indicate that the modified Sombor index m SO has a better coefficient of determination with the boiling points than that of the Sombor index SO in all three regressions. Similarly, the coefficient of determination of the modified Sombor energy E MS with the boiling points is better than that of the Sombor energy E SO in all three regressions.

Conclusions
Every weighted adjacency matrix has its own importance. The following facts seem to be interesting to note about some particular weighted adjacency matrices:

•
The energy of a graph cannot be an odd integer (Bapat and Pati [36]). • The arithmetic-geometric energy of a graph can be any integer greater than one (Zheng, Tian and Cui [37]).

•
The modified Sombor energy of every regular complete multipartite is √ 2. Thereby, we obtain a large family of modified Sombor equienergetic graphs (see Corollary 1). • The modified Sombor spectral radius of every regular graph is 1 √ 2 (see Proposition 2).
Moreover, we remark that there exists only one pair of Sombor equienergetic graphs and only one pair of modified Sombor equienergetic graphs among all chemical graphs of the order of at most seven. This gives the insight that Sombor equienergetic graphs and modified Sombor equienergetic graphs are rare in comparison to equienergetic graphs (there exists exactly three pairs of equienergetic graphs among all chemical graphs of the order of at most seven). Furthermore, we remark that the modified Sombor index and modified Sombor energy give a better correlation than their corresponding classical versions with the boiling points of the chemical graphs of the order of at most seven; this provides motivation to further study the topological indices defined via the modified Sombor matrix.
The Sombor matrix (modified Sombor) and their corresponding indices are new topics of research both in mathematics and theoretical chemistry. All of the linear algebraic properties of these matrices have yet to be investigated, especially their spectral radii, energies, norms, Estrada indices, eigenvalue distributions, and, most importantly, the characterization of their extremal graphs. Similarly, the modified Sombor index is new, and all interesting properties are unknown, specifically in the chemical modeling of alkanes.