[BACK]
 Computer Systems Science & EngineeringDOI:10.32604/csse.2022.018227 Article

Vertex-Edge Degree Based Indices of Honey Comb Derived Network

1Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, Pakistan
2College of Computer Sciences and Information Technology, Jazan University, Jazan, Saudi Arabia
*Corresponding Author: Muhammad Ibrahim. Email: mibtufail@gmail.com
Received: 01 March 2021; Accepted: 29 April 2021

Abstract: Chemical graph theory is a branch of mathematics which combines graph theory and chemistry. Chemical reaction network theory is a territory of applied mathematics that endeavors to display the conduct of genuine compound frameworks. It pulled the research community due to its applications in theoretical and organic chemistry since 1960. Additionally, it also increases the interest the mathematicians due to the interesting mathematical structures and problems are involved. The structure of an interconnection network can be represented by a graph. In the network, vertices represent the processor nodes and edges represent the links between the processor nodes. Graph invariants play a vital feature in graph theory and distinguish the structural properties of graphs and networks. In this paper, we determined the newly introduced topological indices namely, first ve -degree Zagreb α index, first ve -degree Zagreb β index, second ve -degree Zagreb index, ve -degree Randic index, ve -degree atom-bond connectivity index, ve -degree geometric-arithmetic index, ve -degree harmonic index and ve -degree sum-connectivity index for honey comb derived network. In the analysis of the quantitative structure property relationships (QSPRs) and the quantitative structureactivity relationships (QSARs), graph invariants are important tools to approximate and predicate the properties of the biological and chemical compounds. Also, we give the numerical and graphical representation of our outcomes.

Keywords: Honey comb derived network; ev-degree; topological indices

1  Introduction

A structural molecular diagram is a basic diagram in the study of structural chemical graph theory where atoms are spoken to by nodes and chemical bonds are spoken to by lines. A diagram is associated if there is an association between any pair of nodes. A network is an associated diagram that has no various lines between two nodes and loop. The number of nodes which are associated with a fixed node v is known as the degree of v and is denoted by dv . The collection of all the adjacent nodes to the node v is referred to open neighborhood of v and can be represented by N(v) . The open neighborhood became the closed neighborhood when we include the node v in the collection and is represented by N[v] . The shortest distance between two vertices u,v ∈V(G) is denoted by d(u,v), and the maximum value of d(u,v) in G is called the diameter of G, denoted as diam(G). For basic definition, see West [1].

The relation between the (QSPR) and (QSAR) predict the properties and natural exercises of unstudied material. In these materials, the topological indices and some physico-chemical properties are utilized to anticipate bioactivity for chemical compounds [25]. A number represents a topological index in a diagram of a chemical compound, which can be utilized to portray the underlined chemical compound and help to foresee its physio-chemical properties. In 1947 Weiner established the framework of topological index. He was approximated the breaking point of alkanes and presented the Weiner index [6]. In 1975, Milan Randic presented Randic index [7]. In 1998, Bollobas et al. [8] and Amic et al. [9] proposed the general Randic index and has been concentrated by both scientist and mathematicians [10]. The Randic index is one of the most important and generally considered and applied topological index. Numerous surveys, papers and books [1116] are composed on graph invariant. For detail of different topological indices, see [1722]. Chellali et al. [23] introduced two novel degree thoughts which they called “ ve -degree and ev -degree”. Horoldagva et al. [24] contributed to the study related to “ ve -degree and ev -degree”. The new style degree base indices have been applied to already existing indices and found the better results in [2527]. It has been found that the ve -degree Zagreb index has more grounded estimate power than the old-style Zagreb index.

2  The ve -degree and ev -degree Based Topological Indices

Chellali et al. [23] gave the definition of ev -degree of an edge e=uvE which is denoted by dev(e) , and is the cardinality of nodes of the union of the closed neighborhoods of u and v . The ve -degree of the node vV , denoted by dve(v) , and is the cardinality of lines of different lines that are incident to any node from the closed neighborhood of v . Throughout this paper we consider G is a connected graph, e=uvE(G) and vV . For some basic definitions regarding “ ev -degree and ve -degree topological indices” [2830]. The topological indices related to ev -degree are: The ev -degree Zagreb index, ev -degree Randic index, The topological indices related to ev -degree are: The first ve -degree Zagreb α index, first ve -degree Zagreb β index, second ve -degree Zagreb index, ve -degree Randic index, ve -degree atom-bond connectivity index, ve -degree geometric-arithmetic index, ve -degree harmonic index and ve -degree sum-connectivity index.

3  Main Results

In the present section, we determined our computational results for Honey Comb derived network (see Fig. 1), which is a planar graph. The number of nodes and lines in HcDN1(n) are 9n23n+1 and 27n221n+6 respectively.

Figure 1: HcDN1(n) network with n=4

There are five types of lines in HcDN1(n) based on degrees of end nodes of each line. Tab. 1 shows line partition of HcDN1(n) . Tab. 2 represents the number of nodes corresponding their degrees.

In Tab. 3, We partition the lines, based on ev -degree of the HcDN1 . In Tabs. 4 and 5, we partition the nodes, based on ve -degree of HcDN1 .

4  Computing Indices for HcDN1 Formulas

In this section, we will calculate ev -degree and ve -degree based indices of the different types of indices which are given as under;

ev degree Zagreb Index

Now with the help of Tab. 3, we compute the ev -degree based Zagreb index of HcDN1 as:

Mev(HcDN1)=eE(HcDN1)dev(e)2, Mev(HcDN1)=6×62+12(n1)×82+6n×92+18(n1)×112+(27n257n+30)×122=216+768n768+486n+2178n2178+3888n28208n+4320=3888n24776n+1590.

• The first ve -degree Zagreb α index

Now with the help of Tab. 4, we compute the first ve -degree Zagreb α index of HcDN1 as:

M1αve(HcDN1)=vV(HcDN1)dve(v)2, M1αve(HcDN1)=12×122+6(n2)×142+6(n1)×202+6×222+6(n2)×252+6(n1)×292+(9n227n+19)×302=1728+1176n2352+2400n2400+2904+3750n7500+5046n5046+8100n224300+17100+5046n5046+8100n224300+17100=8100n211928n+4434.

• The first ve -degree Zagreb β index

Now with the help of Tab. 5, we compute the first ve -degree Zagreb β index of HcDN1 as:

M1βve(HcDN1)=uvE(HcDN1)(dve(u)+dve(v)), M1βve(HcDN1)=6×24+12×32+12×34+12×42+12×51+6×58+6(3n5)×59+6(n1)×49+12(n2)×34+6(n2)×39+12(n2)×45+12(n2)×54+6(n2)×55+(27n293n+78)×6=144+384+408+504+612+348+1062n1770+294+408n816+234n468+540n1080+648n1296+330n660+1620n25580n+4680=1620n22064n+696.

• The second ve-degree Zagreb index

Now with the help of Tab. 5, we compute the second ve -degree based Zagreb index of HcDN1 as:

M2ve(HcDN1)=uvE(HcDN1)(dve(u)×dve(v)), M2ve(HcDN1)=6×144+12×240+12×264+12×440+12×638+6×841+6(3n5)×870+6(n1)×580+12(n2)×280+6(n2)×350+12(n2)×500+12(n2)×725+6(n2)×750+(27n293n+78)×900=864+2880+3168+5280+7656+5046+15660n26100+3480n3480+3360n6720+2100n4200+6000n12000+8700n17400+4500n9000+24300n283700n+70200=24300n239900n+16194.

• The ve -degree Randic index

Now with the help of Tab. 5, we compute the ve -degree Randic index of HcDN1 as:

Rve(HcDN1)=uvE(HcDN1)(dve(u)×dve(v))12, Rve(HcDN1)=6×14412+12×24012+12×26412+12×44012+12×63812+6×84112+6(3n5)×87012+6(n1)×58012+12(n2)×28012+6(n2)×35012+12(n2)×50012+12(n2)×72512+6(n2)×75012+(27n293n+78)×90012 =612+12415+12266+122110+12638+6841+18870n30870+62145n62145+12270n24270+6514n12514+12520n24520+12529n24529+6530n12530+2730n29330n+7830 =910n2+(18870+3145+670+6514+12520+12529+65303110)n+12+315+666+6110+12638+6841308703145127012514245202452912530+135 =0.9n20.0013n+0.122

• The ev -degree Randic index

Now with the help of Tab. 3, we compute the ev -degree based Randic index of HcDN1 as:

Rev(HcDN1)=eE(HcDN1)dev(e)12, Rev(HcDN1)=6×612+12(n1)×612+6n×912+18(n1)×1112+(27n257n+30)×1212 =2712n2+(62+2+18115712)n+(6621811+153). =7.794n24.785+1.44.

• The atom-bond connectivity index

Now with the help of Tab. 5, we compute the atom-bond connectivity index of HcDN1 as:

ABCve(HcDN1)=uvE(HcDN1)dve(u)+dve(v)2dve(u)×dve(v), ABCve(HcDN1)=6×242144+12×322240+12×342264+12×422440+12×512638+6×582841+6(3n5)×592870+6(n1)×492580+12(n2)×+6(n2)×392350+12(n2)×452500+12(n2)×542725+6(n2)×552750+(27n293n+78)×602900 =62212+1230415+482266+24102110+84638+1214841+1857870n3057870+6472145n6472145+482270n962270+637514n1237514+1243520n2443520+2413529n4813529+653530n1253530+275830n2935830n+785830 =95810n2+(1857870+347145+2435+63714+124320+2413529+653530315810)n+222+32+2433+1211+84638+12148413057870347214548351237514244352048135291253530+13585. =6.854n2+18.92n+1.855.

• The geometric-arithmetic index

Now with the help of Tab. 5, we compute the geometric-arithmetic index of HcDN1 as:

GAve(HcDN1)=uvE(HcDN1)2degve(u)×dve(v)dve(u)+dve(v), GAve(HcDN1)=6×214424+12×224032+12×226434+12×244042+12×263851+6×284158+6(3n5)×287059+6(n1)×258049+12(n2)×228034+6(n2)×235039+12(n2)×250045+12(n2)×272554+6(n2)×275055+(27n293n+78)×290060 =6+315+246617+81107+863817+684129+3687059n6087059+2414549n2414549+247017n487017+201413n401413+8203n16203+20299n40299+123011n243011+27n293n+78 =(3687059+2414549+247017+201413+8203+20299+12301193)n+6+315+246617+81107+863817+684129608705924145494870174014131620340299243011+78+27n2 =27n221.669n+6.195.

• The harmonic index

Now with the help of Tab. 5, we compute the Harmonic index of HcDN1 as:

Hve(HcDN1)=uvE(HcDN1)2dve(u)+dve(v), Hve(HcDN1)=6×224+12×232+12×234+12×242+12×251+6×258+6(3n5)×259+6(n1)×249+12(n2)×234+6(n2)×239+12(n2)×245+12(n2)×254+6(n2)×255+(27n293n+78)×260 =12+34+1217+47+817+629+3659n6059+12491249+1217n2417+413n813+815n1615+49n89+1255n2455+910n23110n+135 =0.90n20.036n+0.122.

• The sum-connectivity index

Now with the help of Tab. 5, we compute the Sum-connectivity index of HcDN1 as:

χve(HcDN1)=uvE(HcDN1)(dve(u)+dve(v))12, χve(HcDN1)=6×2412+12×3212+12×3412+12×4212+12×5112+6×5812+6(3n5)×5912+6(n1)×4912+12(n2)×3412+6(n2)×3912+12(n2)×4512+12(n2)×5412+6(n2)×5512+(27n293n+78)×6012 =36+32+1234+1242+1251+658+1859n3059+67n67+1234n2434+639n1239+45n85+46n86+655n1255+27215n293215n+3915 =27215n2+(1859+67+1234+639+45+46+65593215)n+36+32+1234+1242+1251+6583059672434123985861255+3915 =3.486n21.556n+0.531.

5  Numerical and Graphical Representation and Discussion

The ve and ev for ten different types od degree base topological descriptors for the HcDN1 are calculated both numerically and graphically. From Fig. 2 it is clearly noted that the behavior of first Zegreb alpha index, first Zagreb beta index and second Zagreb index is almost same in the increasing direction as the value of n increases while ev Zagreb index value has a very rapid increase with the increase value of n . From Fig. 3 it is clearly noted that the behavior of atom bond connectivity index and geometric arithmetic index are almost closely increasing with the increase value of n while ev Randic index value has a very rapid increase with the increase value of n . The numerical representation of HcDN1 is shown in Tabs. 68. The graphical representation of HcDN1 are shown in Figs. 24.

Figure 2: Graphical comparison of Mev , M1αve , M1βve and M2ve

Figure 3: Graphical comparison of Rev , ABCve and GAve

Figure 4: Graphical comparison of Rve , Hve and χve

6  Conclusion

There are many applications of topological descriptors in computer science, networks, agriculture and chemical graph theory etc. These descriptors help in finding the behavior of their structures. We dealt with the honey comb derived network and computed ten different types of topological descriptors which are base on ev and ve degree. We have computed their explicit formulas and then computed their numerical values for different values of n . Further we plotted their graphs for comparison and discussed their behavior. We observe that the values of all descriptors increases with the increase value of n . In the analysis of the quantitative structure property relationships (QSPRs) and the quantitative structureactivity relationships (QSARs), graph invariants are important tools to approximate and predicate the properties of the biological and chemical compounds. In this paper, we study the vertex-edge based topological indices for honey comb derived network.

Funding Statement: The authors received no specific funding for this study.

Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.

References

1.  1.  D. B. West, Introduction to graph theory, Second Edition. Pearson Education (Singapore) Pte. Ltd., 2002.
2.  2.  G. Rcker and C. Rcker, “On topological indices, boiling points, and cycloalkanes,” Journal of Chemical Information and Computer Sciences, vol. 39, no. 5, pp. 788–802, 1999.
3.  3.  S. Klavzar and I. Gutman, “A comparison of the Schultz molecular topological index with the Wiener index,” Journal of Chemical Information and Computer Sciences, vol. 36, no. 5, pp. 1001–1003, 1996.
4.  4.  F. M. Bruckler, T. Doslic, A. Graovac and I. Gutman, “On a class of distance-based molecular structure descriptors,” Chemical Physics Letters, vol. 503, no. 4–6, pp. 336–338, 2011.
5.  5.  H. Deng, J. Yang and F. Xia, “A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes,” Computers and Mathematics with Applications, vol. 61, no. 10, pp. 3017–3023, 2011.
6.  6.  H. Wiener, “Structural determination of paraffin boiling points,” Journal of the American Chemical Society, vol. 69, pp. 17–20, 1947.
7.  7.  M. Randic, “Characterization of molecular branching,” Journal of the American Chemical Society, vol. 97, no. 23, pp. 6609–6615, 1975.
8.  8.  B. Bollobas and P. Erdos, “Graphs of extremal weights,” Ars Combinatoria, vol. 50, pp. 225–233, 1998.
9.  9.  D. Amic, D. Beslo, B. Lucic, S. Nikolic and N. Trinajstic, “The vertex-connectivity index revisited,” Journal of Chemical Information and Computer Sciences, vol. 38, no. 5, pp. 819–822, 1998.
10. 10. Y. Hu, X. Li, Y. Shi, T. Xu and I. Gutman, “On molecular graphs with smallest and greatest zeroth-order general Randic index,” MATCH Communication in Mathematical and in Computer Chemistry, vol. 54, no. 2, pp. 425–434, 2005.
11. 11. X. Li, I. Gutman and M. Randic, “Mathematical aspects of Randic-type molecular structure descriptors,”University of Kragujevac and Faculty of Science, Kragujevac, 2006.
12. 12. M. Randic, “On history of the Randic index and emerging hostility toward chemical graph theory,” MATCH Communication in Mathematical and in Computer Chemistry, vol. 59, pp. 5–124, 2008.
13. 13. M. Randic, “The connectivity index 25 years after,” Journal of Molecular Graphics and Modelling, vol. 20, no. 1, pp. 19–35, 2001.
14. 14. I. Gutman and B. Furtula, “Recent results in the theory of Randic index,”University of Kragujevac and Faculty of Science, Kragujevac, 2008.
15. 15. X. Li and Y. Shi, “A survey on the Randic index,” MATCH Communication in Mathematical and in Computer Chemistry, vol. 59, no. 1, pp. 127–156, 2008.
16. 16. S. Nikolic, G. Kovacevic, A. Milicevic and N. Trinajstic, “The Zagreb indices 30 years after,” Croatica Chemica Acta, vol. 76, no. 2, pp. 113–124, 2003.
17. 17. I. Gutman and K. C. Das, “The first Zagreb index 30 years after,” MATCH Communication in Mathematical and in Computer Chemistry, vol. 50, no. 1, pp. 83–92, 2004.
18. 18. K. C. Das and I. Gutman, “Some properties of the second Zagreb index,” MATCH Communication in Mathematical and in Computer Chemistry, vol. 52, pp. 103–112, 2004.
19. 19. I. Gutman, A. Milicevic, S. Nikolic and N. Trinajstic, “About the Zagreb Indices,” Kemija u Industriji, vol. 59, no. 12, pp. 577–589, 2010.
20. 20. N. Idrees, R. Khalid, F. B. Farooq and S. Nasir, “Computing topological invariants of triangular chandelier lattice,” CMC-Computers, Materials & Continua, vol. 63, no. 3, pp. 1119–1132, 2020.
21. 21. A. Milicevic, S. Nikolic and N. Trinajstic, “On reformulated Zagreb indices,” Molecular Diversity, vol. 8, no. 4, pp. 393–399, 2004.
22. 22. A. N. A. Koam, A. Ahmad and M. F. Nadeem, “Comparative study of valency-based topological descriptor for hexagon star network,” Computer Systems Science and Engineering, vol. 36, no. 2, pp. 293–306, 2021.
23. 23. M. Chellali, T. W. Haynes, S. T. Hedetniemi and T. M. Lewis, “On degrees and degrees in graphs,” Discrete Mathematics, vol. 340, no. 2, pp. 31–38, 2017.
24. 24. B. Horoldagva, K. C. Das and T. A. Selenge, “On ve-degree and ev-degree of graphs,” Discrete Optimization, vol. 31, pp. 1–7, 2019.
25. 25. S. Ediz, “A new tool for QSPR researches: ev-degree Randi index,” Celal Bayar University Journal of Science, vol. 13, no. 3, pp. 615–618, 2017.
26. 26. B. Sahin and S. Ediz, “On ev-degree and ve-degree topological indices,” Iranian Journal of Mathematical Chemistry, vol. 9, no. 4, pp. 263–277, 2018.
27. 27. S. Ediz, “On ve-degree molecular topological properties of silicate and oxygen networks,” International Journal of Computing Science and Mathematics, vol. 9, no. 1, pp. 1–12, 2018.
28. 28. M. Cancan, “On ev-degree and ve-degree topological properties of Tickysim spiking neural network,” Computational Intelligence and Neuroscience, Article ID 8429120,2019.
29. 29. A. Ahmad, “Comparative study of ve-degree and ev-degree topological descriptors for benzene ring embedded in P-type-surface in 2D network,” Polycyclic Aromatic Compounds, 2020.
30. 30. M. Cancan, “On harmonic and ev-degree molecular topological properties of DOX, RTOX and DSL networks,” CMC-Computers, Materials & Continua, vol. 59, no. 3, pp. 777–786, 2019.