Abstract
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 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 can be generated from six triangles. A three dimensional hexagonal mesh can be obtained by adding a layer of triangles around the each wall of . In the similar way, can be produced by adding n layers around all the sides of every proceeding hexagonal mesh.
FIGURE 1
Drawing algorithm of
networks.
Step-1: First, we draw a hexagonal network of dimension n.
Step-2: All the subgraphs are converted into planar octahedron network and the graph obtained is known as [29] [see Figures 1, 2)] network.
Step-3: An mth can be easily formed from the network (see Figures 2, 3).
FIGURE 2
FIGURE 3
In , m represents the number of rows and n are the number of triangles in each row.
In this article, is considered a network with a vertex set and an edge set of , and is the degree of vertex .
The Randić index [27] is denoted by and makes us aware of Milan and is represented as follows:
The general Randić index is the sum of over all edges , represented as
Trinajstić [31] makes us aware of , which are the first and second Zagreb indices, denoted by and formalized as follows:
Furtula et al. [13] introduced the augmented Zagreb index and described it as
Zhong [37] introduced the harmonic index and described it as
The index atom–bond connectivity (ABC) is one of the well-known 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.
There are three cases for
.
Case-1: For , .
Case-2: For , m is odd and . For , m is odd and . For , m and n both are even. For , m and n both are even.
Case-3: For , m is even and n is odd. For , m is even and n is odd.
Main Results
Simonraj et al. [29] discovered hex-derived networks and found the metric dimension of . 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 , which is derived from hex-derived network and compute the exact results for , Zagreb, harmonic, augmented Zagreb, atom–bond connectivity, and geometric–arithmetic indices for case 1.
Theorem 2.1.1. Consider the chain hex-derived network of type 3 , the general Randić index is equal toProof. Let . Table 1 shows such an edge partition of for . Using Equation , we have
TABLE 1
| where | Number of Edges |
|---|---|
| (4, 4) | |
| (4, 8) | |
| (8, 8) |
Degree-Based Edge partition for m = n
Using edge partitions in Table 1, we get the following.
For , Eq. 2 becomes
By making some calculations, we get
For , Eq. 2 becomes
By making some calculations, we get
For , Eq. 2 becomes
By making some calculations, we get
For , Eq. 2 becomes
By making some calculations, we get
Theorem 2.1.2. Consider the chain hex-derived network of type 3 , the first Zagreb index is equal to
Proof. Let . In Table 1, there is an edge partition of for . 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 chain hex-derived network of type 3 , the augmented Zagreb index and harmonic index are equal to
Proof. Let . 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 asBy making some calculations, we get
Theorem 2.1.4. Let be the chain hex-derived network of third type , then atom–bond connectivity index and geometric–arithematic index are equal toProof. Let . Using Eq. 6, we haveFrom Table 1, using the edge partition, the outcome can be obtained asBy making some calculations, we getUsing 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 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 chain hex-derived network of type 3 , the general Randic index for second case is equal toProof. Let . Table 2 shows such an edge partition of for second case.
TABLE 2
| where | Number of Edges |
|---|---|
| (4, 4) | |
| (4, 8) | |
| (8, 8) |
Degree-Based Edge partition for Case 2.
Using Eq. 2, we get
Using edge partitions in Table 2, we get, for ,
By making some calculations, we getFor ,
By making some calculations, we getFor ,
By making some calculations, we get
For ,
By making some calculations, we get
Theorem 2.2.2. Consider the chain hex-derived network of type 3 , the first Zagreb index is equal toProof. Let . Table 2 shows such an edge partition of for second case.
Using Eq. 3,
Using edge partitions in Table 2, we get
By making some calculations, we get
Theorem 2.2.3. Let be the chain hex-derived network of third type, the augmented Zagreb index and harmonic index are equal to
Proof. Consider be the chain hex-derived network of third type. Using Eq. 4, we get
From Table 1, using the edge partition, the outcome can be obtained as
By making some calculations, we getBy 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.2.4. Let be the chain hex-derived network of third type, then atom–bond connectivity and geometric–arithematic index are equal to
Proof. Consider . 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
Results for the Third Case of Chain Hex Derived Networks of Third Type
In this section, for the very first time, we discuss –derived hex-derived network and compute the exact results forRandic, Zagreb, harmonic, augmented Zagreb, atom–bond connectivity, and geometric–arithmetic indices for case 3.
Theorem 2.3.1. Consider the chain hex-derived network of type 3 , the general index for third case is equal to
Proof. Let . Using Eq. 2, we get
Using edge partitions in Table 3, we get, for
TABLE 3
| where | Number of Edges |
|---|---|
| (4, 4) | |
| (4, 8) | |
| (8, 8) |
Degree-Based Edge partition for Case 3.
By making some calculations, we getFor ,
By making some calculations, we getFor ,
By making some calculations, we get
For ,
By making some calculations, we get
Theorem 2.3.2. Consider the chain hex-derived network of type 3 , the first Zagreb index is equal to
Proof. Let . Table 3 shows such an edge partition of for third case. Using Eq. 3, we get
Using edge partitions in Table 3, we get
By making some calculations, we get
Theorem 2.3.3. Consider the chain hex-derived network of type 3 , the augmented Zagreb index and Harmonic Zagreb index are equal to
Proof. Let . Using Eq. 4,
From Table 3, using the edge partition, the outcome can be obtained as
By making some calculations, we getUsing Eq. 5,
From Table 3, using the edge partition, the outcome can be obtained as
By making some calculations, we get
Theorem 2.3.4. Let be the chain hex-derived network of third type, then atom–bond connectivity index is equal to
Proof. Let . 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 Table 3, using the edge partition, the outcome can be obtained as
By making some calculations, we get
For the comparison of First Zagreb, harmonic, atom–bond connectivity, and geometric–arithmetic indices of for , 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 for , 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 for , 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 for , 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.
TABLE 4
| H | ABC | GA | ||
|---|---|---|---|---|
| (2.2) | 480 | 10.08 | 28.04 | 46.86 |
| (3.3) | 1,152 | 21.46 | 61.88 | 105.14 |
| (4.4) | 2,112 | 37.08 | 108.91 | 186.74 |
| (5.5) | 3,360 | 56.96 | 169.12 | 291.65 |
| (6.6) | 4,896 | 81.08 | 242.53 | 419.88 |
| (7.7) | 6,720 | 109.46 | 329.12 | 571.41 |
| (8.8) | 8,832 | 142.08 | 428.91 | 746.27 |
| (9.9) | 11,232 | 178.96 | 541.88 | 944.43 |
| (10.10) | 13,920 | 220.08 | 668.04 | 1,165.93 |
Numerical computation of for .
FIGURE 4
TABLE 5
| H | ABC | GA | ||
|---|---|---|---|---|
| (3.4) | 1,568 | 28.08 | 84.75 | 140.11 |
| (3.5) | 1984 | 34.70 | 105.76 | 175.08 |
| (3.6) | 2,400 | 41.33 | 126.77 | 210.05 |
| (3.7) | 2,816 | 47.95 | 147.77 | 245.02 |
| (3.8) | 3,232 | 54.58 | 168.78 | 279.99 |
| (3.9) | 3,648 | 61.20 | 189.79 | 314.96 |
| (3.10) | 4,064 | 67.83 | 210.80 | 349.93 |
| (3.11) | 4,480 | 74.45 | 231.81 | 384.90 |
| (3.12) | 4,896 | 81.08 | 252.81 | 419.87 |
| (3.13) | 5,312 | 87.70 | 273.82 | 454.84 |
Numerical computation of network for , where m is odd and n is natural number.
FIGURE 5
TABLE 6
| H | ABC | GA | ||
|---|---|---|---|---|
| (2.4) | 1,024 | 19.08 | 57.79 | 93.48 |
| (2.6) | 1,568 | 28.08 | 86.62 | 140.11 |
| (2.8) | 2,112 | 37.08 | 115.45 | 186.73 |
| (2.10) | 2,656 | 46.08 | 144.28 | 233.36 |
| (2.12) | 3,200 | 55.08 | 173.10 | 279.99 |
| (2.14) | 3,744 | 64.08 | 201.93 | 226.62 |
| (2.16) | 4,288 | 73.08 | 230.76 | 373.24 |
| (2.18) | 4,832 | 82.08 | 259.58 | 419.87 |
| (2.20) | 5,376 | 91.08 | 288.41 | 466.50 |
| (2.22) | 5,920 | 100.08 | 317.24 | 513.13 |
Numerical computation of network for , where m and n both are even.
FIGURE 6
TABLE 7
| H | ABC | GA | ||
|---|---|---|---|---|
| (2.3) | 752 | 14.58 | 43.38 | 70.16 |
| (4.5) | 2,672 | 45.83 | 139.31 | 233.36 |
| (6.7) | 5,744 | 94.08 | 287.99 | 489.81 |
| (8.9) | 9,968 | 159.33 | 489.43 | 839.52 |
| (10.11) | 15,344 | 241.58 | 743.62 | 1,282.48 |
| (12.13) | 21,872 | 340.83 | 1,050.57 | 1818.69 |
| (14.15) | 29,552 | 457.08 | 1,410.27 | 2,448.16 |
| (16.17) | 38,384 | 590.33 | 1822.72 | 3,170.89 |
| (18.19) | 48,368 | 740.58 | 2,287.93 | 3,986.87 |
| (20.21) | 59,504 | 907.83 | 2,805.90 | 4,896.10 |
Numerical computation of network for , where m is even and n is odd.
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.
Statements
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.
Conflict of interest
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Supplementary material
The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fphy.2020.593275/full#supplementary-material
References
1.
AliANazeerWMunirMMin KangS. M-polynomials and topological indices of zigzag and rhombic benzenoid systems. Open Chem (2018). 16(1):73–8. 10.1515/chem-2018-0010
2.
AliHSajjadASajjadA. On further results of hex derived networks. Open J Discret Appl Math (2019). 2(1):32–40. 10.30538/psrp-odam2019.0009
3.
AliHBinyaminMAShafiqMKGaoW. On the degree-based topological indices of some derived networks. Mathematics (2019). 7:612. 10.3390/math7070612
4.
AsifFZahidZZafarS. Leap Zagreb and leap hyper-Zagreb indices of Jahangir and Jahangir derived graphs. Eng Appl Sci Lett (2020). 3(2):1–8. 10.30538/psrp-easl2020.0036
5.
AslamFZahidZZahidZZafarS. 3-total edge mean cordial labeling of some standard graphs. Open J Math Sci (2019). 3(1):129–38. 10.30538/oms2019.0056
6.
BačaMHorváthováJMokrišováMSemaničová-FeňovxcxíkovxaxASuhányiovǎA. On topological indices of carbon nanotube network. Can J Chem (2015). 93:1–4. 10.1139/cjc-2015-0175
7.
BaigAQImranMAliH. On topological indices of poly oxide, poly silicate, DOX and DSL networks. Can J Chem (2015). 93:730739. 10.1139/cjc-2014-0490
8.
BaigAQImranMAliHRehmanSU. Computing topological polynomials of certain nanostructures. J Optoelectron Adv Mater (2015). 17(5–6):877–83.
9.
ChenM-SShinKGKandlurDD. Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans Comput (1990). 39(1):10–8. 10.1109/12.46277
10.
DiudeaMVGutmanILorentzJMolecular topology. Huntington, NY: Nova Science Publishers (2001).
11.
EliasiMIranmaneshAGutmanI. Multiplicative versions of first Zagreb index. Match-Communi Math Compu Chem (2012). 68(1):217.
12.
EstradaETorresLRodriguezaLGutmanI. An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J Chem (1998). 37A:849–55.
13.
FurtulaBGraovacAVukičevićD. Augmented Zagreb index. J Math Chem (2010). 48:370–80. 10.1007/s10910-010-9677-3
14.
GaoWSiddiquiMKNaeemMImranM. Computing multiple ABC index and multiple GA index of some grid graphs. Open Phys (2018). 16(1):588–98. 10.1515/phys-2018-0077
15.
GutmanI. Topological properties of benzenoid systems. Top Curr Chem (1992). 162:2128.
16.
GutmanICyvinSJ. Introduction to the theory of benzenoid hydrocarbons. Berlin, Germany: Springer (1989).
17.
GutmanIRusićBTrinajstiNWilcoxCFJr. Graph theory and molecular orbitals. XII. Acyclic polyenes. J Chem Phys (1975). 62(9):3399–405. 10.1063/1.430994
18.
ImranMBaigAQSiddiquiHMASarwarR. On molecular topological properties of diamond-like networks. Can J Chem (2017). 95:758–70. 10.1139/cjc-2017-0206
19.
LiuJ-BWangCWangSWeiB. Zagreb indices and multiplicative Zagreb indices of Eulerian graphs. Bull Malays Math Sci Soc (2019). 42(1):67–78. 10.1007/s40840-017-0463-2
20.
LiuJ-BZhaoJHeHShaoZ. Valency-based topological descriptors and structural property of the generalized sierpiński networks. J Stat Phys (2019). 177(6):1131–47. 10.1007/s10955-019-02412-2
21.
LiuJ-BZhaoJMinJCaoJ. The hosoya index of graphs formed by a fractal graph. Fractals (2019). 27(8):1950135. 10.1142/s0218348x19501354
22.
LiuJ-BShiZ-YPanY-HCaoJAbdel-AtyMAl-JubooriU. Computing the Laplacian spectrum of linear octagonal-quadrilateral networks and its applications, Polycycl Aromat Comp (2020). 40: 1–12. 10.1080/10406638.2020.1748666
23.
LiuJBJingZZhengQC. On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks. Physica A: Stat Mech Appl (2020). 540:123073. 10.1016/j.physa.2019.123073
24.
LiuJBZhaoJZhuZ. On the number of spanning trees and normalized Laplacian of linear octagonal‐quadrilateral networks. Int J Quant Chem (2019). 119(17):e25971. 10.1002/qua.25971
25.
MunirMNazeerWRafiqueSKangS. M-polynomial and degree-based topological indices of polyhex nanotubes. Symmetry (2016). 8(12):149. 10.3390/sym8120149
26.
NayakAStojmenovicI. Hand book of applied algorithms: solving scientific, engineering, and practical problems. John Wiley & Sons (2007). 560 p.
27.
RandicM. Characterization of molecular branching. J Am Chem Soc (1975). 97:6609–15. 10.1021/ja00856a001
28.
SalemaKKlavzarcSGutmanI. On the role of hypercubes in the resonance graphs of benzenoid graphs. Discret Math (2006). 306:699704. 10.1016/j.disc.2005.11.017
29.
SimonrajFGeorgeA. On the metric dimension of HDN3 and PHDN3. In: Proceedings of the IEEE international conference on power, control, signals and instrumentation engineering (ICPCSI); Chennai, India, 2017 September 21--22 (2017). p 1333–6.
30.
TabassumAUmarMAUmarMAPerveenMRaheemA. Antimagicness of subdivided fans. Open J Math Sci (2020). 4(1):18–22. 10.30538/oms2020.0089
31.
TrinajsticN. Chemical graph theory. London, United Kingdom: Routledge (1992).
32.
UmarMAAliNAliNTabassumAAliBR. Book graphs are cycle antimagic. Open J Math Sci (2019). 3(1):184–90. 10.30538/oms2019.0061
33.
VukićevicDFurtulaB. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J Math Chem (2009). 46:1369–76.
34.
WangDAhmadHNazeerW. Hosoya and Harary polynomials of TUC 4 nanotube. Math Methods Appl Sci (2020). 1–17. 10.1002/mma.6487
35.
WienerH. Structural determination of paraffin boiling points. J Am Chem Soc (1947). 69:17–20. 10.1021/ja01193a005
36.
WeiC-CAliHBinyaminMANaeemMNLiuJ-B. Computing degree based topological properties of third type of hex-derived networks. Mathematics (2019). 7:368. 10.3390/math7040368
37.
ZhongL. The harmonic index for graphs. Appl Math Lett (2012). 25:561–6. 10.1016/j.aml.2011.09.059
Summary
Keywords
Randić, index, first and second Zagreb index, augmented Zagreb index, harmonic index, atom–bond connectivity and geometric–arithmetic index
Citation
Huo Y, Ali H, Binyamin MA, Asghar SS, Babar U and Liu J-B (2020) On Topological Indices of Chain Hex-Derived Network of Third Type. Front. Phys. 8:593275. doi: 10.3389/fphy.2020.593275
Received
24 August 2020
Accepted
23 September 2020
Published
20 November 2020
Volume
8 - 2020
Edited by
Jinjin Li, Shanghai Jiao Tong University, China
Reviewed by
Waqas Nazeer, University of Education, Winneba, Ghana
Mohammad Reza Farahani, Iran University of Science and Technology, Iran
Updates
Copyright
© 2020 Huo, Ali, Binyamin, Asghar, Babar and Liu.
This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Muhammad Ahsan Binyamin, ahsanbanyamin@gmail.com
This article was submitted to Computational Physics, a section of the journal Frontiers in Physics
Disclaimer
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.