On Topological Indices of m t h Chain Hex-Derived Network of Third Type

In theoretical chemistry, the numerical parameters that are used to characterize the molecular topology of graphs are called topological indices. Several physical and chemical properties like boiling point, entropy, heat formation, and vaporization enthalpy of chemical compounds can be determined through these topological indices. Graph theory has a considerable use in evaluating the relation of various topological indices of some derived graphs. In this article, we will compute the topological indices like Randić, first Zagreb, harmonic, augmented Zagreb, atom-bond connectivity, and geometric-arithmetic indices for chain hex-derived network of type 3 C H D N 3 ( m , n ) for different cases of m and n. We will also compute the numerical computation and graphical view to justify our results. Mathematics Subject Classification: 05C12, 05C90


INTRODUCTION AND PRELIMINARY RESULTS
A branch of numerical science called graph theory is the one in which we use tools of graph parameters to reveal the compound phenomenon precisely. Graph theory, for instance, when used in the study of molecular structures, characterizes a field among various disciplines of science known as molecular topology or chemical graph theory.
Chemical graph theory has provided a considerable part of study to chemist through which they can execute graph theory to mathematical demonstrating of chemical marvel. We are usually interested in estimating the structural characters to elaborate quantitative structure-activity relationships using techniques taken from graph theory.
Topological description of chemical structures with required properties can be used to categorize the molecules and to model unknown structures. Molecules and molecular compounds are frequently demonstrated by molecular graph. In graph theory, a molecular graph is the illustration of structural formula of chemical compounds. The vertices are expressed by the atoms of molecule while the edges suggest the covalent bonds between the atoms.
Quantitative structure-activity (QSAR) and structure-property (QSPR) relationships that are used to analyze the organic activities and properties of biological compounds can be studied by the help of a new subject known as cheminformatics, which is the composition of mathematics, information science, and chemistry.
At present, the numerical programming of biological structure with topological descriptors is increasing in consequence in invigorating science, bioinformatics, and pharmaceutics.
In QSAR/QSPR study, physicochemical properties of the topological descriptors like Wiener index, Randić index, sieged index, first and second Zagreb index, augmented Zagreb index, harmonic index, and geometric-arithmetic index are useful to classify the bioactivity of the chemical compounds.
A graph can be characterized by a polynomial, a numeric number, and a sequence of numbers or a matrix. A numeric quantity interrelated with a graph that remains invariant under the graph automorphism and differentiate the topology of graph is called molecular descriptor. A graph theoretical characteristic that is sustained by an isomorphism is called topological descriptor.
At present, in the field of computational chemistry, topological indices have a rising interest, which is actually associated to their use in nonempirical quantitative structure-property relationship and quantitative structure-activity relationship.
Topological descriptor, Top (G), may also be defined with the property of isomorphism, that is, for every graph H isomorphic to G, Top (G) Top (H). The idea of topological indices was first introduced by Weiner [35] during the laboratory work on boiling point of paraffin and named this result as path number, which was later named as Weiner index.
This article takes into account the topological indices of hexagonal networks derived from a hexagonal graph, which contain molecular graphs of unbranched benzene hydrocarbons. Hexagonal structure graphs consist of hexagons that are fused together. Theoretical chemists pay great attention to this class of chemical compounds. Topological index theory has been intensively developed over the past four decades for the individual molecular graphs. Benzene hydrocarbons are not only the major chemical industry raw materials but also harmful pollutants [15,16,28].
Chen et al. [9] derived a hexagonal mesh. Hexagonal mesh made by a set of triangles is shown in Figure 1. There exists no hexagonal mesh with one dimension. A two dimensional hexagonal mesh HX(2) can be generated from six triangles. A three dimensional hexagonal mesh HX(3) can be obtained by adding a layer of triangles around the each wall of HX(2).
In the similar way, HX(n) can be produced by adding n layers around all the sides of every proceeding hexagonal mesh.
Drawing algorithm of HDN3 networks.
Step-1: First, we draw a hexagonal network of dimension n.
Step-2: All the K 3 subgraphs are converted into planar octahedron network POH and the graph obtained is known as HDN3 [29] [see Figures 1, 2)] network.
In CHDN3(m, n), m represents the number of rows and n are the number of triangles in each row.
In this article, G is considered a network with a V(G) vertex set and an edge set of E(G), and d r is the degree of vertex r ∈ V(G).
The Randić index [27] is denoted by R−1 2 (G) and makes us aware of Milan Randić and is represented as follows: The general Randić index is the sum of (d r d s ) α over all edges e rs ∈ E(G), represented as Trinajstić [31] makes us aware of TI′s, which are the first and second Zagreb indices, denoted by M 1 (G) and formalized as follows: Furtula et al. [13] introduced the augmented Zagreb index and described it as (4) Zhong [37] introduced the harmonic index and described it as The index atom-bond connectivity (ABC) is one of the wellknown degree-based topological indices, given by Estrada et al. [12] and defined as Vukićević and Furtula [33] invented the famous geometric-arithmetic index and represented it as Cases for mth chain hex-derived network of third type. CHDN3(m, n) There are three cases for CHDN3(m, n).
Case-1: For m n, (m, n) ≥ 1. Case-2: For m < n, m is odd and n ∈ N. For m > n, m is odd and n ∈ N. For m < n, m and n both are even. For m > n, m and n both are even. Case-3: For m < n, m is even and n is odd. For m > n, m is even and n is odd.

MAIN RESULTS
Simonraj et al. [29] discovered hex-derived networks and found the metric dimension of HDN3. We discuss the newly derived third type of hex-derived networks in this article and calculate the exact results for topological indexes based on degrees. These topological indices and their variants are currently subjected to extensive research activity, see [1-8, 14, 18-25, 30, 32, 34, 36]. For Basic notations and definitions, see [10,17,26,31].

Results for the First Case mth Chain
Hex-Derived Network of Third Type CHDN3 (m, n) In this section, for the very first time, we discuss CHDN3(m, n), which is derived from hex-derived network and compute the exact results for Randic, Zagreb, harmonic, augmented Zagreb, atom-bond connectivity, and geometric-arithmetic indices for case 1.
Proof. Let G CHDN3(m, n). Table 1 shows such an edge partition of G for m n. Using Equation (2), we have Using edge partitions in Table 1, we get the following. For α 1, Eq. 2 becomes By making some calculations, we get For α 1 2 , Eq. 2 becomes By making some calculations, we get By making some calculations, we get By making some calculations, we get Theorem 2.1.2. Consider the mth chain hex-derived network of type 3 CHDN3(m, n), the first Zagreb index is equal to Proof. Let G CHDN3(m, n). In Table 1, there is an edge partition of G for m n. Using Eq. 3, we have Using edge partitions in Table 1, we get By making some calculations, we get Theorem 2.1.3. Consider the mth chain hex-derived network of type 3 CHDN3(m, n), the augmented Zagreb index and harmonic index are equal to .
Proof. Let G CHDN3(m, n). Using Eq. 4, we have From Table 1, using the edge partition, the outcome can be obtained as By making some calculations, we get Using Eq. 5, we have From Table 1, using the edge partition, the outcome can be obtained as By making some calculations, we get Theorem 2.1.4. Let G be the mth chain hex-derived network of third type CHDN3(m, n), then atom-bond connectivity index and geometric-arithematic index are equal to Proof. Let G CHDN3(m, n). Using Eq. 6, we have From Table 1, using the edge partition, the outcome can be obtained as By making some calculations, we get Using Eq. 7, From Table 1, using the edge partition, we get the outcome as, By making some calculations, we get

Results for the Second Case of Chain
Hex-Derived Networks of Third Type CHDN3 (m, n) In this section, for the very first time, we discuss CHDN3(m, n) derived from of hex-derived network and compute the exact results forRandic, Zagreb, harmonic, augmented Zagreb, atom-bond connectivity, and geometric-arithmetic indices for case 2.
Theorem 2.2.1. Consider the mth chain hex-derived network of type 3 CHDN3(m, n), the general Randic index for second case is equal to Proof. Let G CHDN3(m, n). Table 2 shows such an edge partition of G for second case.
Theorem 2.2.4. Let G be the CHDN3(m, n) mth chain hexderived network of third type, then atom-bond connectivity and geometric-arithematic index are equal to Proof. Consider G CHDN3(m, n). By using Eq. 6, we have From Table 2, by using the edge partition, we get the outcome as, By making some calculations, we get Using Eq. 7, we have From Table 2, using the edge partition, we get the outcome as, By making some calculations, we get

Using edge partitions in
By making some calculations, we get  + 51mn + 6n).
Theorem 2.3.4. Let G be the CHDN3(m, n) mth chain hexderived network of third type, then atom-bond connectivity index is equal to Proof. Let G CHDN3(m, n). Using Eq. 6, we get From Table 3, by using the edge partition, the outcome can be obtained as By making some calculations, we get Using Eq. 7, we have From (1)(3mn + 4m + 2n + 6) + 2 2 √ 3 (6mn − 8) By making some calculations, we get • For the comparison of First Zagreb, harmonic, atom-bond connectivity, and geometric-arithmetic indices of CHDN3(m, n) for m n, we computed the indices for different values of m and n. By increasing the values of m and n, we can clearly check from the following Table 4, the order of indices is also increasing, and their graphical structure is shown in Figure 4. • For the comparison of first Zagreb, harmonic, atom-bond connectivity, and geometric-arithmetic indices of CHDN3(m, n) for m < n, where m is odd and n is natural number. By increasing the values of m and n, we can clearly check from the following Table 5, the order of indices is also increasing, and their graphical structure is shown in Figure 5. • For the comparison of first Zagreb, harmonic, atom-bond connectivity, and geometric-arithmetic indices of CHDN3(m, n) for m < n, where m and n both are even. By increasing the values of m and n, we can clearly check from the following Table 6, the order of indices is also increasing, and their graphical structure is shown in Figure 6. • For the comparison of first Zagreb, harmonic, atom-bond connectivity, and geometric-arithmetic indices of CHDN3(m, n) for m < n, where m is even and n is odd. By increasing the values of m and n, we can clearly check from the following Table 7, the order of indices is also increasing, and their graphical structure is shown in Figure 7.

CONCLUSION
In this article, we have calculated the exact solutions for degree-based indices for mth-hex-derived networks of third type. Hex-derived network has a variety of useful applications in pharmacy, electronics, and networking. We obtained the degree-based indices such as Randić, first Zagreb, augmented Zagreb, harmonic, atom-bond connectivity index, and geometric-arithmetic index for hex derived networks. For this network, we have also given the tabular and graphical comparison between indices. We came to know that by increasing the values of m and n, there is also increase in the indices, which shows the correctness of our results. These results may be helpful for people working in computer science and chemistry who encounter hex-derived networks.

DATA AVAILABILITY STATEMENT
All datasets presented in this study are included in the article/ Supplementary Material.

AUTHOR CONTRIBUTIONS
All the authors participated in the preparation and presenting of the manuscript.