Preprint
Article

Symmetry-Adapted Domination Indices: The Enhanced Domination Sigma Index and Their Applications in QSPR Studies of Octane and Its Isomers

Altmetrics

Downloads

175

Views

35

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

12 May 2023

Posted:

12 May 2023

You are already at the latest version

Alerts
Abstract
Molecular descriptors are essential in mathematical chemistry for studying quantitative structure-property relationships (QSPR), and topological indices are a valuable source of information about molecular properties such as size, cyclicity, branching degree, and symmetry. Graph theory has played a crucial role in the development of topological indices and dominating parameters for molecular descriptors. The molecule graph, under graph isomorphism conditions, represents an invariant number, and the graph theory approach considers dominating sets, which are subsets of the vertex set where every vertex outside the set is adjacent to at least one vertex inside the set. The dominating sigma index, a topological index that incorporates the mathematical principles of domination topological indices and the sigma index, is applicable to some families of graphs, such as book graphs, windmill graphs, and some graph operations, which have exact values for this new index. To evaluate the effectiveness of the domination sigma index in QSPR studies, a comparative analysis was conducted to establish an appropriate domination index that correlates with the physicochemical properties of octane and its isomers. Linear and non-linear models were developed using the QSPR approach to predict the properties of interest, and the results showed that both the domination forgotten and domination first Zagreb indices exhibited satisfactory performance in comparison testing. Further research into QSAR/QSPR domination indices is required to build more robust models for predicting the physicochemical properties of organic compounds while maintaining the importance of symmetry.
Keywords: 
Subject: Computer Science and Mathematics  -   Mathematics

1. Introduction

In recent years, mathematical modeling using graphs with parameterized theories or invariants has become increasingly popular across various disciplines in the physical sciences. Disciplines such as computer science, physics, and chemistry have utilized these models to solve complex problems. A critical component of these models is the topological index, which provides valuable information about a graph under graph isomorphism conditions. Topological indices are invariant numbers that convey information about the size, symmetry, branching degree, and cyclicity of a graph. In particular, chemical graph theory has emerged as a leading field that combines graph theory with chemistry to study molecular structures. Among molecular descriptors, topological indices have emerged as the most important ones, providing crucial information about graphs that represent chemical compounds. By utilizing these topological indices, researchers can gain valuable insights into the properties and characteristics of various chemical compounds, allowing them to develop more accurate models and predictions. The integration of graph theory and chemistry has opened up new avenues for research in the physical sciences, and it is an exciting area that promises to yield even more insights and breakthroughs in the years to come. (for more details, [1,2,3,4,5,6]). The study of graph theory and its application to chemistry has become a rapidly growing field of research in recent years. In particular, the use of topological graph indexes has proven to be a valuable tool for understanding the structure-property relationships of chemical compounds. The Chemical Data Bases, which contain over 3000 topological graph indexes, demonstrate the vast amount of information that can be extracted from graphs representing chemical structures. Furthermore, the extensive study of dominating problems within graph theory has led to a wealth of knowledge and research in the field. As evidenced by the 1222 papers listed in the 1998 book, dominating problems have been extensively studied and analyzed, providing a solid foundation for the development of new and innovative approaches to solving problems related to chemical structures. With the continued growth and development of graph theory and its applications in chemistry, we can expect to see even more exciting discoveries and advancements in the future [7,8,9,10].
Highlighted here are some key research studies that demonstrate the significant role of Graph Theory in solving real-world problems. In [11] the authors present a novel approach to solve fractional boundary value problems on the methylpropane graph. The technique involves utilizing fixed point theorems to demonstrate the existence of solutions, as well as studying stability. To demonstrate the efficacy of the method, an example is provided. Turab et al. [12] introduce the isobutane graph and investigates the existence of solutions to fractional boundary value problems using fixed point theory. The study includes two examples to support the findings. While [13], which is Part I of a series of papers, demonstrates that graph theory can be used to provide solutions for problems in distance geometry, potential theory, and theory of metric spaces.
Domination indices are mathematical parameters used in graph theory to study the structural properties of graphs. The concept of domination indices was first introduced in the 1960s, and since then, several types of domination indices have been proposed and investigated [14]. One of the most commonly used domination indices is the total domination number ( γ t ), [15] which is defined as the minimum number of vertices in a dominating set of a graph. The total domination number has been extensively studied in the literature, with several properties and bounds known. For example, the total domination number of a tree is at most n / 2 , where n is the number of vertices in the tree. Another domination index that has received considerable attention is the connected domination number ( γ c ), [16] which is defined as the minimum number of vertices in a dominating set that induces a connected subgraph. The connected domination number has been studied in various contexts, including its relationship with other graph parameters, such as the vertex cover number and the independent domination number. The domination polynomial [17] is another important parameter that has been extensively studied in the literature. The domination polynomial of a graph is a polynomial that encodes the number of dominating sets of each size in the graph. Several properties of the domination polynomial have been established, including its relationship with other graph polynomials, such as the chromatic polynomial and the independence polynomial. Other domination indices that have been investigated in the literature include the independent domination number, the bondage number, the game domination number, and the strong domination number [18]. These parameters have been studied in various contexts, including their relationship with other graph parameters, their computational complexity, and their applicability in real-world problems.
The Sigma index is a topological index introduced by Ivan Gutman in 1978 [19] and [20]. It is defined as the square of the difference between the degrees for all pairs of adjacent vertices in a graph. More specifically, let ζ = ( V , E ) be a graph with vertex set V and edge set E, and let d u be the degree of the vertex u in ζ . Then, the Sigma index is defined as:
σ ζ = u v E ( ζ ) ( d u d v ) 2
The Sigma index has been extensively studied in the literature due to its applicability in various areas of chemistry, including the prediction of physicochemical properties of molecules [21]. Several properties and bounds of the Sigma index have been established, including its relationship with other topological indices such as the Wiener index [22]. Various modifications and generalizations of the Sigma index have also been proposed, such as the modified Sigma index, which takes into account the number of vertices at a given distance from a central vertex [23]. The degree-based Sigma index has also been introduced, which weights the contributions of each pair of vertices by their respective degrees [24]. Overall, the Sigma index and its variations have been shown to be valuable tools in the study of molecular structure and properties, as well as in the analysis of various types of networks. Detailed discussions of Sigma index applications can be found in [25,26,27,28,29]
Hanan Ahmed introduced the concept of domination topological indices in 2021 [30]. The domination topological index (DTI) is defined as the sum of the distances between each vertex and its nearest dominating vertex in a graph. The domination number of a graph is the minimum number of vertices required to dominate the graph, and it is a special case of the DTI. The DTI has been shown to be a useful tool for predicting various physicochemical properties of organic compounds. Several variations and extensions have been proposed in the literature. For example, Hosamani et al. proposed a modified version of the DTI called the modified domination topological index (MDTI) in their paper [31]. The MDTI is defined as the sum of the distances between each vertex and its nearest dominating vertex, where the dominating set is restricted to a subset of vertices with a fixed size. Another variation of the DTI is the connected domination topological index (CDTI), which was introduced by Merrick et al. [32]. The CDTI is defined as the sum of the distances between each vertex and its nearest dominating vertex in a connected subgraph of the graph. The DTI and its variations have been applied in various fields, including chemistry, biology, and computer science. For example, Yousefi et al. [33] used the DTI to develop quantitative structure-property relationship (QSPR) models for predicting the boiling points of organic compounds. In another study, Yang et al. used the CDTI to predict the toxicity of polycyclic aromatic hydrocarbons (PAHs) [34]. Overall, the DTI and its variations have proven to be useful tools for studying the structural properties of graphs and predicting various physicochemical properties of organic compounds. Extensive explanations regarding the applications of topological domination indices can be found in [35,36,37,38,39,40,41].
The combination of the Gutman topological Sigma index and Hanan et al. domination topological index into a single concept, the domination Sigma index, holds great promise in enhancing our understanding of the structural properties of graphs. This new index combines the mathematical principles of domination topological indices with the concept of Sigma index, creating a distinct index that offers valuable information about the molecular properties. The topological Sigma index provides important information about molecular size, symmetry, branching degree, and cyclicity, while the domination topological index provides insights into dominating sets, subsets of the vertex set such that every vertex outside the set is adjacent to at least one vertex inside the set. The combination of these two indices allows for a more comprehensive analysis of the properties of graphs and has the potential to improve our ability to predict the physicochemical properties of organic compounds. This article presents a novel approach to combining these two indices, providing a framework for further research in the field of mathematical chemistry. Our study presents a novel approach that combines the core principles of the Sigma index with the domination degrees of vertices in a graph to formulate a new composite index. This index is termed as the domination Sigma index and is defined as follows:
D σ ζ = u v E ( ζ ) ( d p u d p v ) 2
In [30] Hanan Ahmed et al. have introduced new degree-based topological indices called domination topological indices, which are based on the domination degree set defined as: For each vertex v V ( ζ ) , the domination degree of the vertex v is denoted by d p v and defined as the number of minimal dominating set of ζ which contains v. The first and second domination Zagreb indices and modified first Zagreb domination indices are defined respectively as:
D M 1 ( ζ ) = v V ( ζ ) d p v 2 ,
D M 2 ( ζ ) = u v E ( ζ ) d p u · d p v ,
D M 1 * ( ζ ) = u v E ( ζ ) [ d p u + d p v ] .
The forgotten domination, hyper domination, and modified forgotten domination indices of graphs are defined respectively as:
D F ( ζ ) = v V ( ζ ) d p v 3 ,
D H ( ζ ) = u v E ( ζ ) [ d p u + d p v ] 2 ,
D F * ( ζ ) = u v E ( ζ ) d p u 2 + d p v 2 .
In this study, we aim to investigate the potential of the domination Sigma index and other domination topological indices in predicting the properties of Octanes and its isomers through quantitative structure-property relationship (QSPR) analysis. To achieve this goal, we calculate the domination Sigma index for various families of graphs, including book graphs, compositions of graphs, and special graph classes and find some sharp bounds. By analyzing the domination indices and the new topological index, we hope to gain insights into the properties and structures of these molecules, and apply this knowledge in the design of new chemical compounds with desired properties. However, it is important to acknowledge that the domination Sigma index may not always produce satisfactory results in QSPR analysis. As newly proposed topological indices may not always capture the key features of the chemical structure under investigation, it is not uncommon for a new index to fail to meet expectations. The lack of satisfactory results obtained from the newly introduced topological index may be attributed to its limitations and the nature of the specific property being studied. Nonetheless, it is worth noting that the failure of a new topological index to provide satisfactory results in QSPR analysis does not necessarily imply that the index is of no value. In fact, each new index provides valuable insights into the complex relationship between molecular structure and physical properties. However, the other domination topological indices used in this study have demonstrated good correlation coefficients with the properties of Octanes and its isomers, indicating their effectiveness in predicting such properties. Thus, further research and analysis may be needed to explore the potential of the domination Sigma index in predicting other properties or to modify it to better suit the studied property. Overall, this study contributes to the ongoing process of developing new topological indices and enhancing our understanding of the relationship between molecular structure and physical properties.

2. Preliminaries

In this section, we introduce key concepts, definitions, and assumptions that underpin our research, as well as outline our research questions, methodology, and the structure of our paper.
Let ζ be connected simple graph with V ( ζ ) a set of vertices and E ( ζ ) a set of edges. A set D V is said to bea dominating set of a graph ζ , if for any vertex v V D , there is a vertex u D such that u and v are adjacent. A dominating set D = { v 1 , v 2 , . . . , v r } is minimal if D v i is not a dominating set. A dominating set of ζ of minimum cardinality is said to be a minimum dominating set. Define ζ = min { D : D is minimal dominating set } , and Γ ( ζ ) = max D : D is minimal dominating set . Notation T m ζ which indicates the total number of minimal dominating set of ζ and ρ ( ζ ) = v V ζ d p ( v ) . A graph is said to be full degree graph if the vertices are all of full degree. The m book graph is defined as the graph Cartesian product B m = S ( m + 1 ) × P 2 , where S m is a star graph and P 2 is the path graph on two vertices.The Windmill graph W d r s is an undirected graph constructed for r 2 and s 2 by s copies of the complete graph K r at a shared universal vertex. Examples of these two graphs are desiplies in Figure 1 and Figure 2. A join of two graphs ζ 1 and ζ 2 is denoted by ζ 1 + ζ 2 , with disjoint vertex sets V 1 and V 2 is the graph on the vertex set V 1 V 2 and the edge set E 1 E 2 { v 1 v 2 : v 1 V 1 , v 2 V 2 } . The corona product of two graphs ζ 1 and ζ 2 is defined as the graph obtained by taking one copy of ζ 1 and V ( ζ 1 ) copies of ζ 2 and joining the i t h vertex of ζ 1 to every vertex in the i t h copy of ζ 2 an example in Figure 3.
Definition 1.
A k domination regular graph is a type of graph in which every vertex has exactly k neighbors that are also adjacent to each other. In other words, every vertex is adjacent to exactly k vertices that are themselves mutually adjacent.
In this work, the concept of k domination regular graph plays a crucial role, and therefore it is important to provide some literature review on this terminology. In the following, we will provide an overview of the relevant literature on k domination regular graphs, highlighting their key properties and applications. By understanding the background and context of this concept, readers will be better equipped to comprehend the significance of our research and its contribution to the field. K domination regular graphs have been studied in several papers in graph theory. For example, in [42], the authors investigate the structure of k domination regular graphs and show that these graphs have many interesting properties. They also provide several examples of k domination regular graphs and use them to study the domination number of these graphs. In [43] the authors studies the k domination number of graphs and provides a characterization of k domination regular graphs. The authors show that a connected graph is k domination regular if and only if it is regular and satisfies a certain condition related to the k domination number. They also investigate the relationship between the k domination number and the total domination number of a graph. In [44] Hansberg et al. investigate some properties of k domination regular graphs and provide some examples of these graphs. They also study the relationship between the k domination number and the independence number of a graph, and show that for certain families of graphs, the k domination number and the independence number are equal. Finally, in [45], the authors provide several methods for constructing k domination regular graphs. They show that k domination regular graphs can be constructed from other k domination regular graphs by several operations, including Cartesian product and composition. They also provide some open problems related to k domination regular graphs, such as finding the smallest k for which a k domination regular graph exists. In summary, k domination regular graphs have been studied extensively in the literature, and they have many interesting properties and applications in graph theory. Further research on these graphs can lead to new insights and solutions in various fields, including computer science, chemistry, and physics.
Our paper aims to address several research questions related to the use of the dominating sigma index in predicting the physicochemical properties of organic compounds. Firstly, we provide an explanation of the dominating sigma index and its relationship with topological indices in mathematical chemistry. Next, we develop linear and non-linear models using the QSPR approach to predict the properties of interest and conduct a comparative analysis to evaluate the effectiveness of the domination sigma index and establish an appropriate domination index that correlates with the physicochemical properties of octane and its isomers. Finally, we explore the relationship between topological indices and molecular properties. The paper is structured as follows: Section 3 presents the main results of the domination sigma index, while Section 4 describes the comparative analysis conducted to evaluate its effectiveness and establish an appropriate domination index. Finally, in Section 5, we provide our conclusions and suggestions for further research into QSAR/QSPR domination indices.

3. Main Results

In this Section, we give results of domination Sigma index for the star, complete bipartite and its complement, book graphs, and for the Windmill graph.
Proposition 1.
  • Let ζ S r + 1 the star graph of r + 1 vertices, then D σ S r + 1 = 0 .
  • Let ζ K r the complete graph of r vertices, then D σ K r = 0 .
  • Let ζ S r + 1 , s + 1 the double star graph, then D σ S r + 1 . s + 1 = 0 .
  • Let ζ K r , s the complete bipartite graph where r , s 2 , then D σ K r , s = u v E ( ζ ) ( s r ) 2 = ( s r ) 2 r s .
Proof. 
  • Suppose ζ S r + 1 the star graph of r vertices, we have T m S r + 1 = 2 and d p u = 1 for all u V S r + 1 . Then D σ S r + 1 = 0 .
  • Suppose ζ K r the complete graph of r vertices, we have T m K r = r and d p u = 1 for all u V K r . Then D σ K r = 0 .
  • Suppose ζ S r + 1 , s + 1 the double star graph, we have T m S r + 1 . s + 1 = 4 and d p u = 2 for all u V S r + 1 . s + 1 . Then D σ S r + 1 . s + 1 = 0 .
  • Suppose ζ K r , s the complete bipartite graph where r , s 2 , we have T m K r , s = r s + 2 and
    d p u = r + 1 if u the set of vertices that contains s vertices s + 1 if u the set of vertices that contains r vertices
    Then
    D σ K r , s = u v E ( ζ ) ( s + 1 r + 1 ) 2 = u v E ( ζ ) ( s r ) 2 = ( s r ) 2 r s .
    This completes the proof.
Corollary 1.
Any graph ζ is k domination regular graph if and only if D σ ζ = 0 .
Proof. 
In this case, the sufficient condition is clear. If we consider the necessity condition, D σ ζ = 0 ,
u v E ( ζ ) ( d p u d p v ) 2 = 0 ( d p u d p v ) 2 = 0 d p u d p v = 0 d p u = d p v
for all u , v V ζ , so if d p u = d p v = k then ζ is k domination regular graph. □
Corollary 2.
Let ζ be the complete bipartite graph K r , s . Then D σ K r , s = σ K r , s .
Proof. 
We have
D σ K r , s = u v E ( ζ ) ( d p u d p v ) 2 = u v E ( K r , s ) ( d u + 1 d v + 1 ) 2 = u v E ( K r , s ) ( d u d v ) 2 = σ K r , s .
Proposition 2.
If ζ K r , s , then D σ K r , s ¯ = σ K r , s ¯
Proof. 
Since d p K r , s ¯ = d K r , s , hence we have
D σ K r , s ¯ = u v E ( K r , s ¯ ) ( d p u d p v ) 2 = u v E ( K r , s ) ( d u d v ) 2 = σ K r , s ¯ .
Theorem 1.
If ζ W d r s where s , r 2 . Then D σ W d r s = s ( r 1 ) ( 1 ( r 1 ) s 1 ) 2 .
Proof. 
If ζ W d r s where s , r 2 , we have T m ζ = r 1 s + 1 and
d p u = 1 if u is the center vertex , r 1 s 1 otherwise .
Suppose
E 1 = e : e E W d r s , all edges which are incident with the center vertex . E 2 = e : e E W d r s , all edges of the complete graph .
Then we obtain
D σ W d r s = u v E 1 ( ζ ) ( 1 r 1 s 1 ) 2 + u v E 2 ( ζ ) ( r 1 s 1 r 1 s 1 ) 2 = ( 1 r 1 s 1 ) 2 E 1 = ( 1 r 1 s 1 ) 2 s r 1 .
Which complete the proof. □
Theorem 2.
If ζ B r the book graph for r 3 . Then D σ B r = r 8 2 r + 2 + 2 2 r 1 .
Proof. 
If ζ B r the book graph for r 3 , we have T m B r = 2 r + 3 and
d p u = 3 if u is the center vertex , 2 r 1 + 1 otherwise .
Suppose E 1 denote the set of r edges u i v i with initial and terminal vertices of the same domination degree 2 r 1 + 1 . Let E 2 denote the set containing only one edge u v with initial and terminal vertices of the same domination degree 3. Let E 3 denote the set of 2 r edges of initial vertices of the domination degree 3 and terminal vertices of domination degree 2 r 1 + 1 . Hence
D σ B r = u v E 1 ( ζ ) ( 2 r 1 + 1 2 r 1 + 1 ) 2 + u v E 2 ( ζ ) ( 3 3 ) 2 + u v E 3 ( ζ ) ( 3 2 r 1 + 1 ) 2 = 2 r 2 2 r 1 2 = r 8 2 r + 2 + 2 2 r 1 .
Which complete the proof. □
Theorem 3.
If ζ K n 1 , n 2 , . . . , n k where n 1 , n 2 , . . . , n k 2 . Then D σ K n 1 , n 2 , . . . , n k = σ K n 1 , n 2 , . . . , n k .
Proof. 
Suppose that ζ K n 1 , n 2 , . . . , n k where n 1 , n 2 , . . . , n k 2 , note that for any vertex v K n 1 , n 2 , . . . , n k we have d p v = d v + 1 and E K n 1 , n 2 , . . . , n k = T m K n 1 , n 2 , . . . , n k k , where T m K n 1 , n 2 , . . . , n k = i = 2 k n 2 n i + . . . + n k 1 n k + k . Hence
D σ K n 1 , n 2 , . . . , n k = u v E ( ζ ) ( d u + 1 ) ( d v + 1 ) 2 = u v E ( ζ ) ( d u d v ) 2 = σ K n 1 , n 2 , . . . , n k .

3.1. Domination Sigma Index of Some Graph Operations

This part, provides the domination Sigma index values for some graph operations such as corona product and join of graphs. In the following Theorem we calculate domination Sigma index for the corona graph of any graph ζ and the complete graph and its complement.
Theorem 4.
  • For any connected graph ζ of n 1 vertices and m 1 edges. Then D σ ζ k n 2 = 0 .
  • For any connected graph ζ of n 1 vertices and m 1 edges. Then D σ ζ k n 2 ¯ = 0 .
Proof. 
(1)
Let ξ ζ k n 2 , we note that there are n 2 + 1 n 1 minimal dominating sets in ξ and d p v = n 2 + 1 n 1 1 . Also, there are three types of edges in ξ . All edges of ζ , all edges of k n 2 , and E 1 denote the set of all edges that connect vertex from ζ and a vertex from k n 2 . So, we have
D σ ζ k n 2 = u v E ( ζ ) ( d p u d p v ) 2 + u v E ( k n 2 ) ( d p u d p v ) 2 + u v E 1 ( d p u d p v ) 2 = u v E ( ζ ) ( n 2 + 1 n 1 1 n 2 + 1 n 1 1 ) 2 + u v E ( k n 2 ) ( n 2 + 1 n 1 1 n 2 + 1 n 1 1 ) 2 + u v E 1 ( n 2 + 1 n 1 1 n 2 + 1 n 1 1 ) 2 = 0 + 0 + 0 = 0 .
(2)
Let ξ ζ k n 2 ¯ , for any vertex v V ξ we have T m ξ = i = 1 n 1 n 1 i and d p v = T m ξ 2 n 1 1 . Hence ξ is k domination regular graph, where k = T m ξ 2 n 1 1 which implies that D σ ζ k n 2 ¯ = 0 .
In the following Theorems we calculate domination Sigma index for different cases of join of two graphs. But first we need the following Lemma
Lemma 1.
[35] Let ζ 1 and ζ 2 be any non complete graphs of n 1 and n 2 vertices respectively, and there is no vertex in ζ 1 or ζ 2 of full degree. Then T m ζ 1 + ζ 2 = T m ζ 1 ) + T m ( ζ 2 + n 1 n 2 and
d p ζ 1 + ζ 2 v = d p ζ 1 ( v ) + n 2 if v V ζ 1 d p ζ 2 ( v ) + n 1 if v V ζ 2 .
Theorem 5.
Let ζ 1 and ζ 2 be any non complete graphs of n 1 and n 2 vertices respectively, and there is no vertex in ζ 1 or ζ 2 of full degree. Then
D σ ζ 1 + ζ 2 = D σ ζ 1 ) + D σ ( ζ 2 + n 2 u V ( ζ 1 ) ( d p ζ 1 ( u ) + n 2 ) 2 + n 1 v V ( ζ 2 ) ( d p ζ 2 ( v ) + n 1 ) 2 2 ρ ( ζ 1 ) ρ ( ζ 2 ) 2 n 1 n 2 ρ ( ζ 1 ) 2 n 1 n 2 ρ ( ζ 2 ) 2 n 1 2 n 2 2 .
Proof. 
Let ζ 1 and ζ 2 be any non complete graphs of n 1 and n 2 vertices respectively, and there is no vertex in ζ 1 or ζ 2 of full degree. Then
D σ ζ 1 + ζ 2 = u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 1 ) + u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 2 ) + u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 3 )
For (1):
u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 1 ) ( d p ζ 1 ( u ) + n 2 ) ( d p ζ 1 ( v ) + n 2 ) ) 2 = u v E ( ζ 1 ) ( d p ζ 1 ( u ) d p ζ 1 ( v ) ) 2 = D σ ζ 1
For (2):
u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 2 ) ( d p ζ 2 ( u ) + n 1 ) ( d p ζ 2 ( v ) + n 1 ) ) 2 = u v E ( ζ 2 ) ( d p ζ 2 ( u ) d p ζ 2 ( v ) ) 2 = D σ ζ 2
For (3):
u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = d p ζ 1 ( u 1 ) + n 2 d p ζ 2 ( v 1 ) + n 1 2 + d p ζ 1 ( u 1 ) + n 2 d p ζ 2 ( v 2 ) + n 1 2 + . . . + d p ζ 1 ( u 1 ) + n 2 d p ζ 2 ( v n 2 ) + n 1 2 + d p ζ 1 ( u 2 ) + n 2 d p ζ 2 ( v 1 ) + n 1 2 + d p ζ 1 ( u 2 ) + n 2 d p ζ 2 ( v 2 ) + n 1 2 + . . . + d p ζ 1 ( u 2 ) + n 2 d p ζ 2 ( v n 2 ) + n 1 2 + . . . + d p ζ 1 ( u n 1 ) + n 2 d p ζ 2 ( v 1 ) + n 1 2 + d p ζ 1 ( u n 1 ) + n 2 d p ζ 2 ( v 2 ) + n 1 2 + . . . + d p ζ 1 ( u n 1 ) + n 2 d p ζ 2 ( v n 2 ) + n 1 2 = n 2 d p ζ 1 ( u 1 ) + n 2 2 + v V ζ 2 d p ζ 2 ( v ) + n 1 2 2 d p ζ 1 ( u 1 ) v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 d p ζ 1 ( u 1 ) 2 n 2 v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 2 + n 2 d p ζ 1 ( u 2 ) + n 2 2 + v V ζ 2 d p ζ 2 ( v ) + n 1 2 2 d p ζ 1 ( u 2 ) v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 d p ζ 1 ( u 2 ) 2 n 1 n 2 d p ζ 1 ( u 2 ) 2 n 2 v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 2 + . . . + n 2 d p ζ 1 ( u n 1 ) + n 2 2 + v V ζ 2 d p ζ 2 ( v ) + n 1 2 2 d p ζ 1 ( u n 1 ) v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 d p ζ ( u n 1 ) 2 n 2 v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 2 = n 2 u V ζ 1 d p ζ 1 ( u ) + n 2 2 + n 1 v V ζ 2 d p ζ 2 ( v ) + n 1 2 2 u V ζ 1 d p ζ 1 ( u ) v V ζ 2 d p ζ 2 ( v ) 2 n 1 n 2 u V ζ 1 d p ζ 1 ( u ) 2 n 1 n 2 v V ζ 2 d p ζ 2 ( v ) 2 n 1 2 n 2 2 = n 2 u V ζ 1 d p ζ 1 ( u ) + n 2 2 + n 1 v V ζ 2 d p ζ 2 ( v ) + n 1 2 2 ρ ( ζ 1 ) ρ ( ζ 2 ) 2 n 1 n 2 ρ ( ζ 1 ) 2 n 1 n 2 ρ ( ζ 2 ) 2 n 1 2 n 2 2 .
Now adding (1), (2) and (3) we conclude our result. □
Using the fact [35] that for any graph ζ , we have ρ ( ζ ) T m ( ζ 1 ) Γ ( ζ ) . We conclude the following
Corollary 3.
Let ζ 1 and ζ 2 be any non complete graphs of n 1 and n 2 vertices respectively, and there is no vertex in ζ 1 or ζ 2 of full degree. Then
D σ ζ 1 + ζ 2 D σ ζ 1 ) + D σ ( ζ 2 + n 2 u V ( ζ 1 ) ( d p ζ 1 ( u ) n 2 ) 2 + n 1 v V ( ζ 2 ) ( d p ζ 2 ( v ) n 1 ) 2 2 T m ( ζ 1 ) Γ ( ζ 1 ) T m ( ζ 2 ) Γ ( ζ 2 ) 2 n 1 n 2 T m ( ζ 1 ) Γ ( ζ 1 ) 2 n 1 n 2 T m ( ζ 2 ) Γ ( ζ 2 ) 2 n 1 2 n 2 2 .
Proposition 3.
Let ζ 1 and ζ 2 are both complete graphs of n 1 and n 2 vertices respectively. Then D σ ζ 1 + ζ 2 = 0 .
Proof. 
Let ζ 1 and ζ 2 are both complete graphs of n 1 and n 2 vertices respectively, then T m ζ 1 + ζ 2 = n 1 + n 2 and d p ζ 1 + ζ 2 v = 1 for all v V ζ 1 + ζ 2 which implies that ζ 1 + ζ 2 is 1 domination regular graph. Hence D σ ζ 1 + ζ 2 = 0 .
Theorem 6.
If ζ 1 is a complete graph and ζ 2 is not a complete graphs of n 1 and n 2 vertices respectively. Then
D σ ζ 1 + ζ 2 = D σ ( ζ 2 ) + n 1 n 2 + n 1 D M 1 ( ζ 2 ) 2 n 1 ρ ( ζ 2 ) .
Proof. 
Let ζ 1 be a complete graph and ζ 2 is not a complete graphs of n 1 and n 2 vertices respectively, then T m ζ 1 + ζ 2 = n 1 + T m ( ζ 2 ) and
d p ζ 1 + ζ 2 v = 1 if v V ζ 1 d p ζ 2 ( v ) if v V ζ 2 .
Hence,
D σ ζ 1 + ζ 2 = u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 1 ) + u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 2 ) + u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 3 )
For (1):
u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 1 ) ( 1 1 ) 2 = 0 .
For (2):
u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 2 ) ( d p ζ 2 ( u ) d p ζ 2 ( v ) ) 2 = D σ ζ 2 .
For (3):
u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = 1 d p ζ 2 ( v 1 ) 2 + 1 d p ζ 2 ( v 2 ) 2 + . . . + 1 d p ζ 2 ( v n 2 ) 2 + 1 d p ζ 2 ( v 1 ) 2 + 1 d p ζ 2 ( v 2 ) 2 + . . . + 1 d p ζ 2 ( v n 2 ) 2 + . . . + 1 d p ζ 2 ( v 1 ) 2 + 1 d p ζ 2 ( v 2 ) 2 + . . . + 1 d p ζ 2 ( v n 2 ) 2 = ( 1 + d p ζ 2 2 ( v 1 ) 2 d p ζ 2 ( v 1 ) ) + ( 1 + d p ζ 2 2 ( v 2 ) 2 d p ζ 2 ( v 2 ) ) + . . . + ( 1 + d p ζ 2 2 ( v n 2 ) 2 d p ζ 2 ( v n 2 ) ) + ( 1 + d p ζ 2 2 ( v 1 ) 2 d p ζ 2 ( v 1 ) ) + ( 1 + d p ζ 2 2 ( v 2 ) 2 d p ζ 2 ( v 2 ) ) + . . . + ( 1 + d p ζ 2 2 ( v n 2 ) 2 d p ζ 2 ( v n 2 ) ) + . . . + ( 1 + d p ζ 2 2 ( v 1 ) 2 d p ζ 2 ( v 1 ) ) + ( 1 + d p ζ 2 2 ( v 2 ) 2 d p ζ 2 ( v 2 ) ) + . . . + ( 1 + d p ζ 2 2 ( v n 2 ) 2 d p ζ 2 ( v n 2 ) ) = n 2 + v V ζ 2 d p ζ 2 2 ( v ) 2 v V ζ 2 d p ζ 2 ( v ) + n 2 + v V ζ 2 d p ζ 2 2 ( v ) 2 v V ζ 2 d p ζ 2 ( v ) + . . . + n 2 + v V ζ 2 d p ζ 2 2 ( v ) 2 v V ζ 2 d p ζ 2 ( v ) = n 1 n 2 + n 1 v V ζ 2 d p ζ 2 2 ( v ) 2 n 1 v V ζ 2 d p ζ 2 ( v ) = n 1 n 2 + n 1 D M ( ζ 2 ) 2 n 1 ρ ( ζ 2 ) .
Adding ( 1 ) , ( 2 ) , and ( 3 ) we complete the proof. □
Theorem 7.
If ζ 1 is not a complete graph and ζ 2 is a complete graph of n 1 and n 2 vertices respectively. Then
D σ ζ 1 + ζ 2 = D σ ( ζ 1 ) + n 1 n 2 + n 2 D M 1 ( ζ 1 ) 2 n 1 ρ ( ζ 1 ) .
Proof. 
Let ζ 1 be not complete graph and ζ 2 is a complete graphs of n 1 and n 2 vertices respectively, then T m ζ 1 + ζ 2 = n 2 + T m ( ζ 1 ) and
d p ζ 1 + ζ 2 v = 1 if v V ζ 2 d p ζ 1 ( v ) if v V ζ 1 .
Hence,
D σ ζ 1 + ζ 2 = u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 1 ) + u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 2 ) + u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 3 )
For (1):
u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 2 ) ( d p ζ 1 ( u ) d p ζ 1 ( v ) ) 2 = D σ ζ 1 .
For (2):
u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E ( ζ 2 ) ( 1 1 ) 2 = 0 .
For (3):
u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = d p ζ 1 ( u 1 ) 1 2 + d p ζ 1 ( u 1 ) 1 2 + . . . + d p ζ 1 ( v 1 ) 1 2 + d p ζ 1 ( u 2 ) 1 2 + d p ζ 1 ( u 2 ) 1 2 + . . . + d p ζ 1 ( v n 2 ) 1 2 + . . . + d p ζ 1 ( u n 1 ) 1 2 + d p ζ 1 ( u n 1 ) 1 2 + . . . + d p ζ 1 ( u n 1 ) 1 2 = n 2 d p ζ 1 ( u 1 ) 1 2 + n 2 d p ζ 1 ( u 2 ) 1 2 + . . . + n 2 d p ζ 1 ( u n 1 ) 1 2 = n 2 u V ζ 1 d p ζ 1 ( u ) 1 2 = n 2 u V ζ 1 d p ζ 1 2 ( u ) 2 d p ζ 1 ( u ) + 1 = n 2 u V ζ 1 d p ζ 1 2 ( u ) 2 n 2 u V ζ 1 d p ζ 1 ( u ) + u V ζ 1 1 = n 2 n 1 + n 2 D M ( ζ 1 ) 2 n 1 ρ ( ζ 1 ) .
Adding ( 1 ) , ( 2 ) , and ( 3 ) we complete the proof. □
Lemma 2.
If ζ 1 and ζ 2 are any non complete graphs of n 1 , m 1 and n 2 , m 2 vertices and edges respectively, such that A ζ 1 contains all vertices of full degrees and B ζ 2 contains all vertices of full degrees. Then T m ζ 1 + ζ 2 = T m ( ζ 1 ) + T m ζ 2 + n 1 A n 2 B and
d p ζ 1 + ζ 2 v = d p ζ 1 ( v ) + n 2 B if v V ζ 1 and v A , d p ζ 2 ( v ) n 1 A if v V ζ 2 and v B , d p ζ 1 ( v ) if v V ζ 1 and v A , d p ζ 2 ( v ) if v V ζ 2 and v B .
Theorem 8.
If ζ 1 and ζ 2 are any non complete graphs of n 1 , m 1 and n 2 , m 2 vertices and edges respectively, such that A V ζ 1 contains all vertices of full degrees and B V ζ 2 contains all vertices of full degrees. Then
D σ ζ 1 + ζ 2 = D σ ζ 1 + D σ ζ 2 + n 2 B 2 E 5 + n 1 A 2 E 6 2 n 2 B u v E 5 u A v A d p ζ 1 ( u ) d p ζ 1 ( v ) + n 1 A u v E 6 u B v B d p ζ 2 ( u ) d p ζ 2 ( v ) + u v E 8 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 1 A 2 E 8 2 n 1 A u v E 8 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) + u v E 9 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 2 B 2 E 9 + 2 n 2 B u v E 9 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) + u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 2 n 1 + A B 2 E 10 + 2 n 2 n 1 + A B u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) .
Proof. 
Suppose ζ 1 and ζ 2 are any non complete graphs of n 1 , m 1 and n 2 , m 2 vertices and edges respectively, such that A V ζ 1 contains all vertices of full degrees and B V ζ 2 contains all vertices of full degrees. Then T m ζ 1 + ζ 2 = T m ζ 1 + T m ζ 2 + n 1 A n 2 B and
d p ζ 1 + ζ 2 v = d p ζ 1 v + n 2 B if v V ζ 1 and v A , d p ζ 1 v if v V ζ 1 and v A , d p ζ 2 v + n 1 A if v V ζ 2 and v B , d p ζ 2 v if v V ζ 2 and v B .
We divide the edge set of ζ 1 + ζ 2 according to the degree domination of the vertices as follows:
E 1 = { e = u v : u , v A } , E 2 = { e = u v : u , v B } , E 3 = { e = u v : u , v A } , E 4 = { e = u v : u , v B } , E 5 = { e = u v : u A , v ζ 1 A } , E 6 = { e = u v : u B , v ζ 2 B } , E 7 = { e = u v : u A , v B } , E 8 = { e = u v : u A , v ζ 2 B } , E 9 = { e = u v : u ζ 1 A , v B } , E 10 = { e = u v : u ζ 1 A , v ζ 2 B } .
Hence,
D σ ζ 1 + ζ 2 = u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 1 ) + u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 2 ) + u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 3 ) = u v E 1 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 + . . . + u v E 10 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 .
Now we calculate the summation for each term as follows:
u v E 1 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 1 1 1 2 = 0 u v E 2 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 2 1 1 2 = 0 u v E 3 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 3 d p ζ 1 ( u ) + n 2 B d p ζ 1 ( v ) + n 2 B 2 = u v E 3 ( d p ζ 1 ( u ) d p ζ 1 ( v ) ) 2 u v E 4 ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 4 d p ζ 2 ( u ) + n 1 A d p ζ 2 ( v ) + n 1 A 2 = u v E 4 ( d p ζ 2 ( u ) d p ζ 2 ( v ) ) 2 u v E 5 u A v A ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 5 u A v A d p ζ 1 ( u ) + n 2 B d p ζ 1 ( v ) 2 = u v E 5 u A v A d p ζ 1 2 ( u ) + n 2 B d p ζ 1 ( u ) d p ζ 1 ( u ) d p ζ 1 ( v ) + n 2 B d p ζ 1 ( u ) + n 2 B 2 ( n 2 B ) d p ζ 1 ( v ) d p ζ 1 ( u ) d p ζ 1 ( v ) ( n 2 B ) d p ζ 1 ( v ) + d p ζ 1 2 ( v ) = u v E 5 u A v A ( d p ζ 1 ( u ) d p ζ 1 ( v ) ) 2 + ( n 2 B ) 2 E 5 2 ( n 2 B ) u v E 5 u A v A d p ζ 1 ( u ) d p ζ 1 ( v ) .
We notice that the edges of ζ 1 are E 1 , E 3 , and E 5 . Hence
u v E ( ζ 1 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 1 ) = D σ ζ 1 + n 2 B 2 E 5 2 n 2 B u v E 5 u A v A d p ζ 1 ( u ) d p ζ 1 ( v ) .
Now
u v E 6 u B v B ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 6 u B v B d p ζ 2 ( u ) + n 1 A d p ζ 2 ( v ) 2 = u v E 6 u B v B [ d p ζ 2 ( u ) d p ζ 2 ( v ) 2 + n 1 A 2 2 n 1 A u v E 6 u B v B d p ζ 2 ( u ) d p ζ 2 ( v ) ] = u v E 6 u B v B [ d p ζ 2 ( u ) d p ζ 2 ( v ) 2 + n 1 A 2 E 6 2 n 1 A u v E 6 u B v B d p ζ 2 ( u ) d p ζ 2 ( v ) ] .
We notice that the edges of the graph ζ 2 are the edges of E 2 , E 4 , and E 6 . Hence
u v E ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 2 ) = D σ ζ 2 + n 1 A 2 E 6 2 n 1 A u v E 6 u B v B d p ζ 2 ( u ) d p ζ 2 ( v ) .
Now we move to calculate the results on edges between vertices of ζ 1 and vertices of ζ 2
u v E 7 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 7 u V ζ 1 , u A v V ζ 2 , v B 1 1 2 = 0 . u v E 8 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 8 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) 2 + n 1 A 2 E 8 2 n 1 A u v E 8 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) . u v E 9 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 9 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) 2 + n 2 B 2 E 9 + 2 n 2 B u v E 9 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) . u v E 10 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 = u v E 10 u V ζ 1 , u A v V ζ 2 , v B [ ( d p ζ 1 ( u ) + n 2 B ) ( d p ζ 2 ( v ) + n 1 A ) ] 2 = u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 2 n 1 + A B 2 + 2 n 2 n 1 + A B d p ζ 1 ( u ) d p ζ 2 ( v ) = u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 2 n 1 + A B 2 E 10 + 2 n 2 n 1 + A B u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) .
Hence we have
u V ( ζ 1 ) v V ( ζ 2 ) ( d p ζ 1 + ζ 2 ( u ) d p ζ 1 + ζ 2 ( v ) ) 2 ( 3 ) = u v E 8 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) 2 + n 1 A 2 E 8 2 n 1 A u v E 8 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) + u v E 9 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) 2 + n 2 B 2 E 9 + 2 n 2 B u v E 9 u V ζ 1 , u A v V ζ 2 , v B ( d p ζ 1 ( u ) d p ζ 2 ( v ) ) + u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) 2 + n 2 n 1 + A B 2 E 10 + 2 n 2 n 1 + A B u v E 10 u V ζ 1 , u A v V ζ 2 , v B d p ζ 1 ( u ) d p ζ 2 ( v ) .
Now adding (1),(2), and (3) we obtain our result. □

3.2. Bounds for Domination Sigma Index

To make accurate predictions using topological indices, it is crucial to comprehend the potential range of values that these indices can assume. Determining the bounds of topological indices is a significant task when it comes to predicting the properties of chemical compounds. The bounds refer to the minimum and maximum values that an index can attain. Being aware of the bounds of a topological index can assist researchers in identifying the range of values that are physically relevant and in gaining an understanding of the connection between the topological characteristics of a molecular graph and the properties of a chemical compound. In this section, we will present some lower and upper bounds for the Domination Sigma index.
Theorem 9.
If ζ = V ζ , E ζ with order n and size m is not a K domination regular graph then
n 2 u V ζ d p u + D M 1 ζ D σ ζ .
Proof. 
We have 1 d p v , then
1 d p u 1 2 d p v 1 d p u 1 2 1 d p u 2 2 d p v 2 d p u 2 2 1 d p u n 2 d p v n d p u n 2
In the left side we take the summation over all vertices of ζ , and in the right side we take the summation over all edges of ζ . Hence
1 2 d p u n + d p u n 2 d p v n d p u n 2 n 2 u V ζ d p u + D M 1 ζ D σ ζ .
Which complete the proof. □
Theorem 10.
If ζ = V ζ , E ζ with order n and size m is not a K domination regular graph then
D σ ζ < n T m 2 ζ 2 T m ζ u V ζ d p u + D M 1 ζ .
Proof. 
We have d p u < T m ζ , hence
d p v 1 d p u 1 2 < T m ζ d p u 1 2 d p v 2 d p u 2 2 < T m ζ d p u 2 2 d p v 3 d p u 3 2 < T m ζ d p u 3 2 d p v n d p u n 2 < T m ζ d p u n 2
Similarly of Theorem 9 we get
u v E ζ d p v d p u 2 < T m 2 ζ T m ζ d p u + d p u 2
Hence D σ ζ n T m 2 ζ 2 T m ζ u V ζ d p u + D M 1 ζ .
Proposition 4.
If ζ = V ζ , E ζ with order n and size m is not a K domination regular graph then
  • n 2 T m ζ γ ζ + D M 1 ζ D σ ζ ,
  • D σ ζ < n T m 2 ζ T m 2 ζ Γ ζ + D M 1 ζ .
Proof. 
We have T m ζ γ ζ u V ζ d p u T m ζ Γ ζ . Hence by Theorems 9 and 10 we obtain our results. □

4. Statistical Validity of Domination Indices

Physicochemical and biological properties of molecules are predicted and modeled through QSPR analysis. To extract maximum information from a data set, chemometrics is a powerful tool that incorporates statistical and mathematical methods. Chemical descriptors of a molecule’s chemical structure are used in QSPR to describe how physicochemical properties vary as a consequence of chemometric methods. Hence, calculated descriptors can replace expensive biological tests or experiments concerning a particular physicochemical property. In turn, these descriptors can be used to predict the properties of interest for upcocompounds. QSPR works by finding a quantitative relationship that can be utilized for the prediction of compounds’ properties, even those that can’t be measured. As a matter of fact, QSPR models are primarily affected by the molecular structure parameters employed. Alternative molecular descriptors have been developed that are derived solely from chemical structure information. Researchers have focused much attention on connecting and composing molecules in order to determine "topological indices" that can be used in QSPR analyses. In addition to having the advantage of simplicity, the topological index is also fast to calculate, so scientists are interested in using it. A compound’s physicochemical and biological properties are influenced by its molecular structure, according to several chemical and medical experiments. Quantitative structure property/activity relationship ( Q S A R / Q S P R ) models are generated by employing mathematical/statistical tools to determine this dependence. Regression models are used for relating physicochemical/biological properties to molecular descriptors. The graph-theoretic topological indices generate Q S A R / Q S P R models by converting compounds into chemical graphs. To be accepted by Milan Randic [46], topological indices must meet certain criteria, the most significant of which is to be positively correlated with at least one physicochemical property. The purpose of this section is to investigate the significance of these newly developed domination topological indices. Octane and some of its isomers are described in Table 1 according to their experimental data [47], and also https://pubchem.ncbi.nlm.nih.gov (accessed on 26 March 2022). Computed domination indices values are shown in Table 2. Our analysis has shown that these indices play role in evaluating Entropy (E), Acentric factor (AF), Enthalpy of vaporization (HVAP), and Standard enthalpy of vaporization (DHVAP). A correlation coefficient ( R ) between these indices and some physicochemical properties can be seen in Table 3.

4.1. Regression Model

QSPR analysis of domination topological indices will be discussed in this subsection. Furthermore, we demonstrate a positive correlation between the characteristics and the physicochemical characteristics of octane and its isomers. Here we discuss how topological indices can be used to predict physicochemical properties. We calculated six domination topological indices and one physicochemical property using R-software. Based on the below nonlinear regression model, we can derive different nonlinear models for the topological indices of domination:
ln C P = A + B ln D I
For the domination Sigma index we use the linear regression model because we have some values of zeros
C P = A + B D I
where C P is the physical and chemical properties of octanes and its isomers and D I represents the domination topological indices. By using Equations 9 and 10, we can obtain different linear and non-linear models for the domination topological indices as follows:
  • The domination first Zagreb index D M 1 ( ζ ) :
    ln A F = 1 . 6 + 0 . 12 ln D M 1 ( ζ )
    ln S = 4 . 4 + 0 . 04 ln D M 1 ( ζ )
    ln H V A P = 4 . 05 + 0 . 03 ln D M 1 ( ζ )
    ln D H V A P = 1 . 9 + 0 . 05 ln D M 1 ( ζ )
  • The domination second Zagreb index D M 2 ( ζ ) :
    ln A F = 1 . 5 + 0 . 1 ln D M 2 ( ζ )
    ln S = 4 . 5 + 0 . 04 ln D M 2 ( ζ )
    ln H V A P = 4 . 07 + 0 . 03 ln D M 2 ( ζ )
    ln D H V A P = 1 . 9 + 0 . 05 ln D M 2 ( ζ )
  • The domination modified first Zagreb index D M 1 * ( ζ ) :
    ln A F = 1 . 9 + 0 . 2 ln D M 1 * ( ζ )
    ln S = 4 . 3 + 0 . 08 ln D M 1 * ( ζ )
    ln H V A P = 3 . 9 + 0 . 07 ln D M 1 * ( ζ )
    ln D H V A P = 1 . 7 + 0 . 1 ln D M 1 * ( ζ )
  • The domination forgotten index D F ( ζ ) :
    ln A F = 1 . 5 + 0 . 08 ln D F ( ζ )
    ln S = 4 . 43 + 0 . 4 ln D F ( ζ )
    ln H V A P = 4 . 08 + 0 . 02 ln D F ( ζ )
    ln D H V A P = 1 . 9 + 0 . 03 ln D F ( ζ )
  • The domination hyper index D H ( ζ ) :
    ln A F = 1 . 7 + 0 . 11 ln D H ( ζ )
    ln S = 4 . 39 + 0 . 04 ln D H ( ζ )
    ln H V A P = 4 . 02 + 0 . 03 ln D H ( ζ )
    ln D H V A P = 1 . 8 + 0 . 05 ln D H ( ζ )
  • The domination modified forgotten index D F * ( ζ ) :
    ln A F = 1 . 6 + 0 . 1 ln D F * ( ζ )
    ln S = 4 . 439 + 0 . 04 ln D F * ( ζ )
    ln H V A P = 4 . 05 + 0 . 03 ln D F * ( ζ )
    ln D H V A P = 1 . 9 + 0 . 05 ln D F * ( ζ )
  • The domination Sigma index D σ ( ζ ) :
    A F = 0 . 3 + 0 . 003 D σ ( ζ )
    S = 102 . 75 + 0 . 4 D σ ( ζ )
    H V A P = 68 . 03 + 0 . 16 D σ ( ζ )
    D H V A P = 8 . 9 + 0 . 03 D σ ( ζ )
Now, the predicted values of physicochemical properties are given in Table 4, Table 5, Table 6 and Table 7. The experimental values vs the predicted values of all properties are shown in Figure 4, Figure 5, Figure 6 and Figure 7.
Table 4. The (AF) values predicted by domination topological indices
Table 4. The (AF) values predicted by domination topological indices
octane and its isomers D M 1 D M 2 D M 1 * D F D H D F *
n-octane 0.3990 0.3862 0.3611 0.4064 0.38918 0.37479
2-Methyl-heptane 0.3545 0.3491 0.3270 0.3617 0.34927 0.35391
3-Methyl-heptane 0.3956 0.3809 0.3566 0.4036 0.38389 0.37066
4-Methyl-heptane 0.3525 0.3458 0.3244 0.3603 0.34642 0.33859
3-Ethyl-hexane 0.3478 0.3454 0.3230 0.3546 0.34444 0.33559
2,2-Dimethyl-hexane 0.3487 0.3408 0.3217 0.3561 0.34262 0.33186
2,3-Dimethyl-hexane 0.3572 0.3522 0.3296 0.3641 0.35233 0.34295
2,4-Dimethyl-hexane 0.3704 0.3636 0.3403 0.3777 0.36475 0.35378
2,5-Dimethyl-hexane 0.3509 0.3436 0.3217 0.3576 0.34262 0.33410
3,3-Dimethyl-hexane 0.3572 0.3522 0.3296 0.3641 0.35233 0.34295
3-Ethyl-2-methyl-pentane 0.3450 0.3286 0.3795 0.3588 0.32913 0.32449
2,2,3-Trimethyl-pentane 0.3614 0.3577 0.3346 0.3675 0.35776 0.35152
2,2,4-Trimethyl-pentane 0.3024 0.3066 0.2869 0.3083 0.30251 0.29856
2,3,3-Trimethyl-pentane 0.3614 0.35767 0.3346 0.3675 0.35755 0.35152
2,3,4-Trimethyl-pentane 0.3614 0.3577 0.3346 0.3675 0.35755 0.35152
2,2,3,3-Tetramethylbutane 0.3060 0.3114 0.2913 0.3112 0.30698 0.30196
Table 5. The (E) values predicted by domination topological indices
Table 5. The (E) values predicted by domination topological indices
octane and its isomers D M 1 D M 2 D M 1 * D F D H D F *
n-octane 102.214 112.1 104.85 108.29 106.16 996.73
2-Methyl-heptane 98.26 107.67 100.78 103.66 102.07 792.54
3-Methyl-heptane 101.92 111.48 104.32 108.009 105.64 953.49
4-Methyl-heptane 98.079 107.26 100.45 103.51 101.76 663.94
3-Ethyl-hexane 97.64 107.20 100.28 102.89 101.55 640.7
2,2-Dimethyl-hexane 97.72 106.62 100.11 103.05 101.36 612.73
2,3-Dimethyl-hexane 98.508 108.04 101.09 103.92 102.39 698.77
2,4-Dimethyl-hexane 99.708 109.43 102.39 105.35 103.69 791.38
2,5-Dimethyl-hexane 97.925 106.98 100.11 103.22 101.36 629.40
3,3-Dimethyl-hexane 98.508 108.04 101.09 103.92 102.39 698.77
3-Ethyl-2-methyl-pentane 97.381 105.09 98.38 102.81 99.89 560.02
2,2,3-Trimethyl-pentane 98.89 108.71 101.7 104.28 102.94 771.2
2,2,4-Trimethyl-pentane 93.19 102.21 95.64 97.64 96.87 401.34
2,3,3-Trimethyl-pentane 98.89 108.71 101.7 104.28 102.94 771.29
2,3,4-Trimethyl-pentane 98.89 108.71 101.7 104.28 102.94 771.29
2,2,3,3-Tetramethylbutane 93.56 102.85 96.2 97.98 97.39 419.95
Table 6. The (HVAP) values predicted by domination topological indices
Table 6. The (HVAP) values predicted by domination topological indices
octane and its isomers D M 1 D M 2 D M 1 * D F D H D F *
n-octane 68.05 69.03 67.25 68.7 68.46 69.1
2-Methyl-heptane 66.07 66.97 64.96 66.73 66.46 67.92
3-Methyl-heptane 67.90 68.74 66.95 68.58 68.20 68.87
4-Methyl-heptane 65.97 66.78 64.77 66.67 66.32 67.02
3-Ethyl-hexane 65.75 66.75 64.68 66.40 66.21 66.84
2,2-Dimethyl-hexane 65.79 66.48 64.58 66.47 66.12 66.6
2,3-Dimethyl-hexane 66.19 67.15 65.14 66.84 66.62 67.28
2,4-Dimethyl-hexane 66.79 67.79 65.87 67.46 67.2 67.9
2,5-Dimethyl-hexane 65.9 66.65 64.58 66.54 66.12 66.76
3,3-Dimethyl-hexane 66.19 67.15 65.1 66.84 66.62 67.28
3-Ethyl-2-methyl-pentane 65.62 65.76 63.6 66.37 65.4 66.17
2,2,3-Trimethyl-pentane 66.39 67.46 65.48 67.004 66.89 67.78
2,2,4-Trimethyl-pentane 63.49 64.41 62.05 64.12 63.9 64.54
2,3,3-Trimethyl-pentane 66.39 67.46 65.48 67.004 66.89 67.78
2,3,4-Trimethyl-pentane 66.39 67.46 65.48 67.004 66.89 67.78
2,2,3,3-Tetramethylbutane 63.68 64.71 62.38 64.27 64.17 64.76
Table 7. The (DHVAP) values predicted by domination topological indices
Table 7. The (DHVAP) values predicted by domination topological indices
octane and its isomers D M 1 D M 2 D M 1 * D F D H D F *
n-octane 8.88 8.79 8.5 8.37 8.53 9.10
2-Methyl-heptane 8.45 8.36 8.09 8.01 8.12 8.85
3-Methyl-heptane 8.84 8.73 8.45 8.34 8.47 9.05
4-Methyl-heptane 8.43 8.32 8.06 8.002 8.09 8.65
3-Ethyl-hexane 8.38 8.31 8.04 7.95 8.07 8.61
2,2-Dimethyl-hexane 8.39 8.26 8.02 7.96 8.05 8.57
2,3-Dimethyl-hexane 8.47 8.39 8.12 8.03 8.15 8.71
2,4-Dimethyl-hexane 8.6 8.53 8.25 8.14 8.28 8.85
2,5-Dimethyl-hexane 8.41 8.29 8.02 7.97 8.05 8.60
3,3-Dimethyl-hexane 8.47 8.39 8.12 8.03 8.15 8.71
3-Ethyl-2-methyl-pentane 8.35 8.11 7.85 7.94 7.01 8.47
2,2,3-Trimethyl-pentane 8.52 8.46 8.18 8.06 8.23 8.82
2,2,4-Trimethyl-pentane 7.91 7.83 7.58 7.54 7.61 8.13
2,3,3-Trimethyl-pentane 8.5 8.46 8.18 8.06 8.23 8.82
2,3,4-Trimethyl-pentane 8.5 8.46 8.18 8.06 8.23 8.82
2,2,3,3-Tetramethylbutane 7.95 7.89 7.63 7.54 7.65 8.17
Table 8. Statical parameters for the non-linear QSPR model for first Zagreb domination index.
Table 8. Statical parameters for the non-linear QSPR model for first Zagreb domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.549 0.3040 9.75 0.029 0.00750
Entropy ( E ) 0.541 0.4141 9.51 3.745 0.0081
Enthalpy of vaporization ( H V A P ) 0.690 0.3236 16.01 1.512 0.0013
Standard enthalpy of vaporization ( D H V A P ) 0.757 0.2774 20.31 0.271 0.0005
Table 9. Statical parameters for the non-linear QSPR model for the second domination Zagreb index.
Table 9. Statical parameters for the non-linear QSPR model for the second domination Zagreb index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.465 0.3827 7.17 0.031 0.0180
Entropy ( E ) 0.461 0.3911 7.07 3.955 0.0187
Enthalpy of vaporization ( H V A P ) 0.614 0.3418 12.28 1.616 0.0035
Standard enthalpy of vaporization ( D H V A P ) 0.659 0.2994 14.46 0.294 0.0019
Table 10. Statical parameters for the linear QSPR model for modified zagreb domination index.
Table 10. Statical parameters for the linear QSPR model for modified zagreb domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.476 0.3794 4.10 0.034 0.0423
Entropy ( E ) 0.465 0.4188 7.19 3.944 0.0179
Enthalpy of vaporization ( H V A P ) 0.615 0.3041 12.31 1.615 0.0035
Standard enthalpy of vaporization ( D H V A P ) 0.659 0.3094 14.85 0.292 0.0018
Table 11. Statical parameters for the non-linear QSPR model for forgotten domination index.
Table 11. Statical parameters for the non-linear QSPR model for forgotten domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.569 0.2949 10.45 0.029 0.0060
Entropy ( E ) 0.561 0.3445 10.20 3.690 0.0065
Enthalpy of vaporization ( H V A P ) 0.704 0.3236 16.82 1.492 0.0011
Standard enthalpy of vaporization ( D H V A P ) 0.694 0.3127 21.08 0.265 0.0004
Table 12. Statical parameters for the linear QSPR model for hyper domination index.
Table 12. Statical parameters for the linear QSPR model for hyper domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.489 0.3480 7.80 0.031 0.0144
Entropy ( E ) 0.482 0.4127 7.63 3.903 0.0153
Enthalpy of vaporization ( H V A P ) 0.635 0.3434 13.24 1.587 0.0027
Standard enthalpy of vaporization ( D H V A P ) 0.691 0.2654 16.06 0.377 0.0012
Table 13. Statical parameters for the non-linear QSPR model for modified forgotten domination index.
Table 13. Statical parameters for the non-linear QSPR model for modified forgotten domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.486 0.3819 7.74 0.031 0.0147
Entropy ( E ) 0.476 0.0063 7.49 3.917 0.0161
Enthalpy of vaporization ( H V A P ) 0.618 0.3343 12.47 1.610 0.0033
Standard enthalpy of vaporization ( D H V A P ) 0.681 0.2799 15.54 0.288 0.0015
Table 14. Statical parameters for the linear QSPR model for sigma domination index.
Table 14. Statical parameters for the linear QSPR model for sigma domination index.
Physical Properties R 2 S e F S F p v a l u e
Acentric factor ( A F ) 0.320 0.033 5.111 0.0014 0.0402
Entropy ( E ) 0.267 4.002 0.1697 0.0012 0.0224
Enthalpy of vaporization ( H V A P ) 0.213 1.963 3.81 0.0833 0.0714
Standard enthalpy of vaporization ( D H V A P ) 0.236 0.366 4.324 0.0155 0.0564

4.2. Results and Discussion

To begin with, it was discovered see Figure 8, that any structure-property relationship could be achieved using the domination forgotten index D F ( ζ ) . Based on Table 3 we can determine that the domination forgotten index D F ( ζ ) is the most appropriate index to model Standard enthalpy of vaporization ( D H V A P ) , Enthalpy of vaporization ( H V A P ) , Entropy ( E ) , and Acentric factor ( A F ) with R = 0 . 879 , 0 . 839 , 0 . 749 , and 0 . 754 , respectively. We have found that our approach using the forgotten domination index D F ( ζ ) has provided a significant improvement in predicting the physicochemical properties of octane and its isomers compared to some of the recent studies. For example, in a study by Xie et al. [48], they used machine learning techniques to predict the physicochemical properties of organic compounds, including octane and its isomers, and reported correlation coefficients between 0 . 648 and 0 . 873 for various properties. In contrast, our approach using the D F ( ζ ) index achieved higher correlation coefficients of 0 . 749 to 0 . 879 for the same properties. It has been demonstrated that the Standard Enthalpy of Vaporization ( D H V A P ) with correlation coefficient range between 0 . 812 0 . 870 (except the correlation coefficient for the dominion Sigma index D σ ( ζ ) which was 0 . 486 ) is best physicochemical property predicted by the new domination indices. We can see from Table 3 that for ( E ) , ( A F ) , ( H V A P ) , and ( D H V A P ) the domination first Zagreb index D M 1 ( ζ ) gives the second highest correlation coefficients R = 0 . 736 , 0 . 741 , 0 . 830 , and 0 . 870 respectively. Furthermore, in a recent study by Zhang et al. [49], they used graph theory-based topological indices to predict the boiling points of organic compounds, including octane and its isomers, and reported correlation coefficients of 0 . 827 to 0 . 873 . In our study, we have also used graph theory-based topological indices, and our approach using the domination first Zagreb index D M 1 ( ζ ) achieved a correlation coefficient of 0 . 870 for predicting the standard enthalpy of vaporization ( D H V A P ) of octane and its isomers. Therefore, we believe that our work provides a significant contribution to the field of predicting the physicochemical properties of organic compounds and offers a promising alternative to the existing approaches. It is worth noting that our finding that the domination first Zagreb index D M 1 ( ζ ) provides a high degree of correlation for predicting various physicochemical properties of octane and its isomers is consistent with several recent studies in the field. For example, a study by Ghorbani et al. [50] also found that the M 1 ( ζ ) index was a reliable predictor of various physicochemical properties of hydrocarbons, including octane. Similarly, a study by Moosavi et al. [51] also reported that the M 1 ( ζ ) index was a useful predictor of the thermodynamic properties of various hydrocarbons, including isomers of octane. Overall, our findings, along with those of other studies, highlight the potential usefulness of the M 1 ( ζ ) index in predicting the physicochemical properties of octane and its isomers. However, it is important to note that the effectiveness of this index, like any other index or method, may depend on various factors such as the size and diversity of the dataset, the modeling techniques used, and the specific properties being predicted. Therefore, further investigation is needed to fully understand the potential and limitations of the D M 1 ( ζ ) index and other related indices in the context of predicting physicochemical properties of octane and its isomers.
It is important to note that the other domination topological indices used in this study have demonstrated good effectiveness in predicting the properties of Octanes and its isomers. However, it is also essential to acknowledge that the domination Sigma index, while providing valuable insights into the complex relationship between molecular structure and physical properties, showed poor correlation in this particular study, since it does not allow modifying the values of it using the non-linear model. The limitations of newly proposed topological indices and the specific property being studied can affect its effectiveness. As such, this study highlights the need for further research to explore modifications to the domination Sigma index for better suitability or to investigate its potential in predicting other properties. Additionally, investigating the effectiveness of the newly proposed index for graphs that are not K domination regular graph can be an exciting avenue for future research.

5. Conclusion

The concept of domination in graph theory is a fundamental problem that involves finding the smallest set of vertices in a graph that collectively cover all the other vertices. The domination Sigma index is a measure that quantifies this problem by assigning a numerical value to each graph. In this paper, the authors focus on computing the domination Sigma index for different types of graphs, such as book graphs and compositions of graphs. One of the key contributions of this paper is the introduction of the k-domination regular graph. This type of graph is particularly interesting because it provides a useful tool for studying domination theory. A k domination regular graph is a graph where every vertex has the same number k of neighbors in each dominating set of the graph. The authors use this concept to compute the domination Sigma index for some special graph classes and also identify areas where further investigation is needed. The authors also apply their findings to the study of octane and its isomers using QSPR analysis. This analysis assesses the significance of domination indices and a newly invented topological index. However, the results for the domination Sigma index of octane and its isomers show a poor correlation coefficient for most molecular structures and properties under study. This finding highlights the need for further investigation into the newly invented domination index, which utilizes graphs that are not k-domination regular graphs. In conclusion, this paper makes a valuable contribution to the field of graph theory by exploring the domination Sigma index and k domination regular graphs. The application of QSPR analysis to assess the significance of these indices also highlights the interdisciplinary nature of graph theory and its applications. Further investigation into the newly invented domination index and its application to real-world problems could potentially lead to new insights and solutions in various fields. As future work, researchers could investigate the domination Sigma index for other types of graphs and explore their properties such as Mycielski [52,53], Thorn [54], Sierpiński [55,56], Helm [57] graphs. This would allow for a deeper understanding of the index’s capabilities and limitations in various contexts. Additionally, exploring the properties of non k domination regular graphs could also yield valuable insights into the index’s behavior. For example, investigating the relationship between the domination index and other graph properties, such as connectivity or edge density, could help determine the usefulness of the index in different graph-theoretic applications [58,59,60,61,62]. The interdisciplinary nature of graph theory and its applications presents numerous opportunities for future research. Finally, this paper lays a foundation for future researchers to explore the domination Sigma index and its applications in greater depth.

Author Contributions

Conceptualization, S.W. and H.A., methodology, S.W., validation, S.W. and H.A., formal analysis, S.W., investigation, S.W. and H.A., resources, H.A., data curation, H.A., writing— original draft S.W., preparation, S.W., writing— review and editing, S.W.and H.A., supervision, S.W., project administration, S.W., funding acquisition, S.W. All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

All kinds of data and materials, used to compute the results, are provided in Section 1.

Acknowledgments

This research work was funded by Institutional Fund Projects under grant no. (IFPIP:762-247-1443). The authors gratefully acknowledge technical and financial support provided by the Ministry of Education and King Abdulaziz University. DSR, Jeddah, Saudi Arabia.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Gutman, I. . Geometric approach to degree-based topological indices: Sombor indices. MATCH Commun. Math. Comput. Chem 2021, 86, 11–16. [Google Scholar]
  2. Das, K.C.; Çevik, A.S.; Cangul, I.N.; Shang, Y. On Sombor index. Symmetry 2021, 13, 140. [Google Scholar] [CrossRef]
  3. Randić, M. Generalized molecular descriptors. J. Math. Chem. 1991, 7, 155–168. [Google Scholar] [CrossRef]
  4. Wazzan, S.; Saleh, A. New Versions of Locating Indices and Their Significance in Predicting the Physicochemical Properties of Benzenoid Hydrocarbons. Symmetry 2022, 14, 1022. [Google Scholar] [CrossRef]
  5. Wazzan, S.; Saleh, A. Locating and Multiplicative Locating Indices of Graphs with QSPR Analysis. J. Math. 2021, 2021, 1–15. [Google Scholar] [CrossRef]
  6. Kirmani, S.A.K.; Ali, P.; Azam, F. Topological indices and QSPR/QSAR analysis of some antiviral drugs being investigated for the treatment of COVID-19 patients. Int. J. Quantum Chem. 2020, 121. [Google Scholar] [CrossRef] [PubMed]
  7. Haynes, T.W.; Slater, P.J. Paired-domination in graphs. Networks 1998, 32, 199–206. [Google Scholar] [CrossRef]
  8. Ullah, A.; Zeb, A.; Zaman, S. A new perspective on the modeling and topological characterization of H-Naphtalenic nanosheets with applications. J. Mol. Model. 2022, 28, 211. [Google Scholar] [CrossRef] [PubMed]
  9. Wang, X.; Hanif, M.F.; Mahmood, H.; Manzoor, S.; Siddiqui, M.K.; Cancan, M. On Computation of Entropy Measures and Their Statistical Analysis for Complex Benzene Systems. Polycycl. Aromat. Compd. 2022, 43, 7754–7768. [Google Scholar] [CrossRef]
  10. Huang, L.; Wang, Y.; Pattabiraman, K.; Danesh, P.; Siddiqui, M.K.; Cancan, M. Topological Indices and QSPR Modeling of New Antiviral Drugs for Cancer Treatment. Polycycl. Aromat. Compd. 2022, 43, 8147–8170. [Google Scholar] [CrossRef]
  11. Rezapour, S.; Deressa, C.T.; Hussain, A.; Etemad, S.; George, R.; Ahmad, B. A Theoretical Analysis of a Fractional Multi-Dimensional System of Boundary Value Problems on the Methylpropane Graph via Fixed Point Technique. Mathematics 2022, 10, 568. [Google Scholar] [CrossRef]
  12. Turab, A.; Sintunavarat, W.; Ro, J.-S. On Novel Mathematical Modeling for Studying a Class of Nonlinear Caputo-Type Fractional-Order Boundary Value Problems Emerging in CGT. Fractal Fract. 2023, 7, 99. [Google Scholar] [CrossRef]
  13. Erdos, P.; Meir, A.; Sós, V.T.; Turán, P. On some applications of graph theory, I. Discrete Mathematics 1972, 2, 207–228. [Google Scholar] [CrossRef]
  14. Haynes, T.W.; Hedetniemi, S.T.; Slater, P.J. Fundamentals of domination in graphs; CRC Press, 1998. [Google Scholar]
  15. Domke, G.R. Domination in graphs: Advanced topics; CRC Press, 2016. [Google Scholar]
  16. Trafalis, T.B. The domination polynomial: A new tool for graph theory. Discrete mathematics 2001, 226, 577–591. [Google Scholar]
  17. Soltani, M.R.; Ashrafi, A.R. Total connected domination in graphs. Discussiones Mathematicae Graph Theory 2011, 31, 715–727. [Google Scholar]
  18. Shanmukha, N.; Bhat, A.N. A survey on game domination in graphs. Graphs and Combinatorics 2014, 30, 765–794. [Google Scholar]
  19. Gutman, I. The concept of modified graph. Bull. Acad. Serbe Sci. Arts 1978, 6, 1–7. [Google Scholar]
  20. IGutman; Togan, M. ; Yurttas, A.; Cevik, A.S.; Cangul, I.N. Inverse Problem for Sigma Index, MATCH Commun. Math. Comput. Chem. 2018, 79, 491–508. [Google Scholar]
  21. Gutman, I.; Togan, M.; Yurttas, A.; Cevik, A.S.; Cangul, I.N. The Sigma molecular descriptor. In Encyclopedia of Computational Chemistry; Wiley, 1998; vol. 4, pp. 2925–2932. [Google Scholar]
  22. Gutman, I. Mathematical chemistry: An overview. Croat. Chem. Acta 2005, 78, 7–29. [Google Scholar]
  23. Ali, M.; Imran, M.; Kang, S.M.; Ali, T.A. A new modification of the Sigma index. J. Math. Chem. 2019, 57, 915–923. [Google Scholar]
  24. Todeschini, R.; Consonni, V.; Laguzzi, A.; Dominguez-Ramirez, L.R. Degree-based Sigma index. MATCH Commun. Math. Comput. Chem. 2018, 80, 83–98. [Google Scholar]
  25. Alyar, S.; Khoeilar, R.; Jahanbani, A. Some topological indices of dendrimers. International Journal of Computational Materials Science and Engineering 2020, 9, 2050018. [Google Scholar] [CrossRef]
  26. Havare, O.C. QSPR Analysis with Curvilinear Regression Modeling and Topological Indices. Iranian Journal of Mathematical Chemistry 2019, 10, 331–341. [Google Scholar]
  27. Du, Z.; Jahanbai, A.; Sheikholeslami, S.M. Relationships between Randic index and other topological indices. Communications in Combinatorics and Optimization 2021, 6, 137–154. [Google Scholar]
  28. Maji, D.; Ghorai, G.; Mahmood, M.K.; Alam, A. On the Inverse Problem for Some Topological Indices. J. Math. 2021, 2021, 1–8. [Google Scholar] [CrossRef]
  29. Nacaroglu, Y. The Sigma Coindex of Graph Operations. J. Math. 2021, 2021, 1–8. [Google Scholar] [CrossRef]
  30. Ahmed, A.H.; Alwardi, A.; Salestina, M.R. On domination topological indices of graphs. International Journal of Analysis and Applications 2021, 19, 47–64. [Google Scholar]
  31. Hosamani, S.M.; Shukla, M.; Lomte, B.A. On a modified domination topological index of graphs. Discrete Applied Mathematics 2011, 159, 500–506. [Google Scholar]
  32. Furst, M.L.; McColley, R.L. On the connected domination number of a graph. Ars Combinatoria 1982, 13, 131–143. [Google Scholar]
  33. Yousefi, S.; Ashrafi, A.R.; Alizadeh, A.M. Quantitative structure-property relationship study of boiling points of organic compounds using novel domination topological index. Journal of Molecular Liquids 2018, 268, 493–499. [Google Scholar]
  34. Zhou, B.; Gao, W.; Wang, Y. Prediction of toxicity of polycyclic aromatic hydrocarbons using connected domination topological index. Environmental toxicology and pharmacology 2012, 33, 54–58. [Google Scholar]
  35. Ahmed, H.; Alwardi, A.; Salestina, M.R.; Nandappa, D.S. Domination, gamma-Domination Topological Indices and phi (P)-Polynomial of Some Chemical Structures Applied for the Treatment of COVID-19 Patients. Biointerface research in applied chemistry 2021, 13290–13302. [Google Scholar]
  36. Bindusree, A.R.; Cangul, I.N.; Lokesha, V.; Cevik, A.S. Zagreb polynomials of three graph operators. Filomat 2016, 30, 1979–1986. [Google Scholar] [CrossRef]
  37. Haynes, T.W.; Hedetniemi, S.; Slater, P. Fundamentals of Domination in Graphs; Taylor & Francis Ltd: London, United Kingdom, 2013; ISBN 9780429157769. [Google Scholar]
  38. Haynes, T. Domination in graphs: volume 2: advanced topics; Routledge, 2017. [Google Scholar]
  39. Cockayne, E.J.; Hedetniemi, S.T. Towards a theory of domination in graphs. Networks 1977, 7, 247–261. [Google Scholar] [CrossRef]
  40. Kulli, V.R.; Sigarkanti, S.C. Inverse domination in graphs. Nat. Acad. Sci. Lett 1991, 14, 473–475. [Google Scholar]
  41. Henning, M.A. A survey of selected recent results on total domination in graphs. Discret. Math. 2009, 309, 32–63. [Google Scholar] [CrossRef]
  42. Hansberg, A.; Meierling, D.; Volkmann, L. Independence and $k-$domination in graphs. International Journal of Computer Mathematics 2011, 88, 905–915. [Google Scholar] [CrossRef]
  43. Wang, C. . The Signed k-Domination Numbers In Graphs. Ars Comb. 2012, 106, 205–211. [Google Scholar]
  44. Hansberg, A.; Pepper, R. . On k-domination and j—independence in graphs. Discrete Applied Mathematics 2013, 161, 1472–1480. [Google Scholar] [CrossRef]
  45. Gabrovšek, B.; Peperko, A.; Žerovnik, J. On the 2-rainbow independent domination numbers of some graphs. Central European Journal of Operations Research 2023, 1–15. [Google Scholar] [CrossRef]
  46. Randić, M. Generalized molecular descriptors. J. Math. Chem. 1991, 7, 155–168. [Google Scholar] [CrossRef]
  47. Ediz, S. Predicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-Degree and ve-Degree Zagreb Indices. Int. J. Syst. Sci. Appl. Math. 2017, 2, 87. [Google Scholar] [CrossRef]
  48. Xie, T. , Zhang, W., Liu, X., Chen, W., & Lin, Z. Machine learning prediction of physicochemical properties for organic compounds. Journal of Molecular Graphics and Modelling. 2021. [Google Scholar]
  49. Zhang, W.; Shi, W.; Liu, X. Prediction of boiling points of organic compounds using graph theory-based topological indices. Journal of Molecular Liquids 2022, 353, 118634. [Google Scholar] [CrossRef]
  50. Ghorbani, M.; Ashrafi, A.R.; Safaei, M.R. Predicting the thermophysical properties of hydrocarbons by applying machine learning methods based on their molecular structure. Journal of Molecular Liquids 2019, 279, 255–266. [Google Scholar]
  51. Moosavi, M.R.; Azizpour, S.; Mohajeri, A. Prediction of standard enthalpy of formation and boiling point for hydrocarbons using graph-theoretical descriptors. Journal of Molecular Graphics and Modelling 2018, 82, 1–8. [Google Scholar]
  52. Pelias, W.P.; Cabahug, I.S. Bipartite Domination Number of Mycielski Graph of Some Graph Families. Asian Res. J. Math. 2023, 19, 41–50. [Google Scholar] [CrossRef]
  53. Dinorog, M.G.; Cabahug, J.I.S. Rings Domination Number of Some Mycielski Graphs. Asian Res. J. Math. 2022, 16–26. [Google Scholar] [CrossRef]
  54. Sooryanarayana, B.; Chandrakala, S.B.; Roshini, G.R.; Kumar, M.V. Resolving Topological Indices of Graphs. Iranian Journal of Mathematical Chemistry 2022, 13, 201–226. [Google Scholar]
  55. Varghese, J.; Anu, V.; Aparna, L.S. , 2022. Domination parameters of generalized Sierpi ´ nski graphs. AKCE International Journal of Graphs and Combinatorics, 1-7.
  56. Maji, D.; Ghorai, G.; Shami, F.A. Some New Upper Bounds for the-Index of Graphs. Journal of Mathematics 2022, 2022. [Google Scholar] [CrossRef]
  57. Radhi, S.J.; Abdlhusein, M.A.; Hashoosh, A.E. Some modified types of arrow domination. International Journal of Nonlinear Analysis and Applications 2022, 13, 1451–1461. [Google Scholar]
  58. Cockayne, E.J.; Hedetniemi, S.T. Towards a theory of domination in graphs. Networks 1977, 7, 247–261. [Google Scholar] [CrossRef]
  59. Chellali, M.; Kheddouci, H. On the Domination Number of Some Classes of Non k-Domination Regular Graphs. Ars Combinatoria 2008, 88, 153–165. [Google Scholar]
  60. Chellali, M.; Kheddouci, H. On the Domination Number of Some Non k-Domination Regular Graphs. Bulletin of the Australian Mathematical Society 2008, 77, 129–138. [Google Scholar]
  61. Kamat, N.; Choudhury, S. On the Domination Number of Some Non k-Domination Regular Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 2018, 107, 31–48. [Google Scholar]
  62. Mukherjee, S.; Bose, S.K. Bounds on the Domination Number of Non k-Domination Regular Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 2014, 88, 83–95. [Google Scholar]
Figure 1. Book graphs: B S 3 , P 2 , B S 4 , P 2 , B S 5 , P 2 , . . .
Figure 1. Book graphs: B S 3 , P 2 , B S 4 , P 2 , B S 5 , P 2 , . . .
Preprints 73493 g001
Figure 2. Windmill graphs: W d 4 3 , W d 2 4 , W d 3 4 , W d 4 4 , . . .
Figure 2. Windmill graphs: W d 4 3 , W d 2 4 , W d 3 4 , W d 4 4 , . . .
Preprints 73493 g002
Figure 3. Corona products of ζ and F
Figure 3. Corona products of ζ and F
Preprints 73493 g003
Figure 4. Experimental vs predicted values: (a) Entropy with D.I.’s (b) Entropy with D M 1 and D F
Figure 4. Experimental vs predicted values: (a) Entropy with D.I.’s (b) Entropy with D M 1 and D F
Preprints 73493 g004
Figure 5. Experimental vs predicted values: (a) Acentric factor with D.I.’s (b) Acentric factor with D M 1 and D F
Figure 5. Experimental vs predicted values: (a) Acentric factor with D.I.’s (b) Acentric factor with D M 1 and D F
Preprints 73493 g005
Figure 6. Experimental vs predicted values: (a) Enthalpy of vaporization with D.I.’s (b) Enthalpy of vaporization with D M 1 and D F
Figure 6. Experimental vs predicted values: (a) Enthalpy of vaporization with D.I.’s (b) Enthalpy of vaporization with D M 1 and D F
Preprints 73493 g006
Figure 7. Experimental vs predicted values: (a) Standared enthalpy of vaporization with D.I.’s (b) Standared enthalpy of vaporization with D M 1 and D F
Figure 7. Experimental vs predicted values: (a) Standared enthalpy of vaporization with D.I.’s (b) Standared enthalpy of vaporization with D M 1 and D F
Preprints 73493 g007
Figure 8. The correlation coefficient R between the physicochemical properties and the different domination indices
Figure 8. The correlation coefficient R between the physicochemical properties and the different domination indices
Preprints 73493 g008
Table 1. Experimental values of some physicochemical properties of octane and its isomers
Table 1. Experimental values of some physicochemical properties of octane and its isomers
octane and its isomers Entropy ( E ) AcenFac ( A F ) HVAP DHVAP
n-octane 111.67 0.397898 73.19 9.915
2-Methyl-heptane 109.84 0.377916 70.30 9.484
3-Methyl-heptane 111.26 0.371002 71.3 9.521
4-Methyl-heptane 109.32 0.371504 70.91 9.483
3-Ethyl-hexane 109.43 0.362472 71.7 9.476
2,2-Dimethyl-hexane 103.42 0.339426 67.7 8.915
2,3-Dimethyl-hexane 108.02 0.348247 70.2 9.272
2,4-Dimethyl-hexane 106.98 0.344223 68.5 9.029
2,5-Dimethyl-hexane 105.72 0.356830 68.6 9.051
3,3-Dimethyl-hexane 104.74 0.322596 68.5 8.973
3,4-Dimethyl-hexane 106.59 0.340345 70.2 9.316
3-Ethyl-2-methyl-pentane 106.06 0.332433 69.7 9.209
3-Ethyl-3-methyl-pentane 101.48 0.306899 69.3 9.081
2,2,3-Trimethyl-pentane 101.31 0.300816 67.3 8.826
2,2,4-Trimethyl-pentane 104.09 0.305370 64.87 8.402
2,3,3-Trimethyl-pentane 102.06 0.293177 68.1 8.897
2,3,4-Trimethyl-pentane 102.39 0.317422 68.37 9.014
2,2,3,3-Tetramethylbutane 93.06 0.255294 66.2 8.410
Table 2. Domination indices of octane and its isomers
Table 2. Domination indices of octane and its isomers
octane and its isomers D M 1 D M 2 D M 1 * D F D H D F * D σ
n-octane 292 241 82 1800 968 486 4
2-Methyl-heptane 109 88 50 419 362 274 10
3-Methyl-heptane 272 210 77 1648 855 435 15
4-Methyl-heptane 104 80 48 400 336 176 16
3-Ethyl-hexane 93 79 47 327 319 161 3
2,2-Dimethyl-hexane 95 69 46 345 304 144 6
2,3-Dimethyl-hexane 116 96 52 456 392 200 8
2,4-Dimethyl-hexane 157 132 61 719 537 273 9
2,5-Dimethyl-hexane 100 75 46 364 304 154 4
3,3-Dimethyl-hexane 116 96 52 456 392 200 8
3,4-Dimethyl-hexane 512 448 112 4096 1792 896 0
3-Ethyl-2-methyl-pentane 87 48 37 319 211 115 19
3-Ethyl-3-methyl-pentane 512 448 112 4096 1792 896 0
2,2,3-Trimethyl-pentane 128 112 56 512 448 256 0
2,2,4-Trimethyl-pentane 29 24 26 57 98 50 2
2,3,3-Trimethyl-pentane 128 112 56 512 448 256 0
2,3,4-Trimethyl-pentane 128 112 56 512 448 256 0
2,2,3,3-Tetramethylbutane 32 28 28 64 112 56 0
Table 3. Correlation coefficients (R) between domination indices and some physiochemical properties of octane and its isomers
Table 3. Correlation coefficients (R) between domination indices and some physiochemical properties of octane and its isomers
Domination indices Entropy AcenFac HVAP DHVAP
D M 1 ( ζ ) 0.736 0.741 0.831 0.870
D M 2 ( ζ ) 0.679 0.682 0.784 0.812
D M 1 * ( ζ ) 0.682 0.690 0.784 0.819
D F ( ζ ) 0.749 0.754 0.839 0.879
D H ( ζ ) 0.694 0.699 0.797 0.831
D F * ( ζ ) 0.690 0.697 0.786 0.825
D σ ( ζ ) 0.517 0.566 0.462 0.486
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated