M-POLYNOMIAL AND RELATED DEGREE-BASED TOPOLOGICAL INDICES OF THE THIRD TYPE OF HEX-DERIVED NETWORK Текст научной статьи по специальности «Математика»

M-polynomial and related degree-based topological indices of the third type of hex-derived network

Shibsankar Das, Shikha Rai

Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi-221005, Uttar Pradesh, India

[email protected], [email protected]

PACS 02.10.Ox, 61.48.-c DOI 10.17586/2220-8054-2020-11-3-267-274

In the field of chemical graph theory, a topological index is a real number which is correlated with the various physical properties, biological activities and chemical reactivities of molecular graphs. In recent trends, M-polynomials are used to compute numerous degree-based topological indices. Hex-derived networks have a wide range of applications in pharmaceutical sciences, electronics and communication networks. In this paper, we would like to determine a general form of M-polynomial for the third type of hex-derived network of dimension n and hence generate the related degree-based topological indices. Additionally, we plot the M-polynomial and all the related degree-based topological indices for several n.

Keywords: Third type of hex-derived network, Degree-based topological indices, M-polynomial, Graph polynomial.

Received: 13 April 2020

Revised: 26 April 2020

1. Introduction

Let G = (V, E) be a simple connected graph, where V = V(G) and E = E(G) respectively denote the vertex set and the edge set which contains unordered pairs of vertices. The degree of a vertex u g V(G) in G is the number of vertices that are adjacent to u and is denoted by d(u) [1].

1.1. A brief review on topological indices and M-polynomials

Mathematical aspects of chemical compounds and their behaviors are being investigated in the area of Chemical Graph Theory (CGT). For a given chemical compound, each atom is represented by a vertex and each chemical bond between the atoms is represented by an edge to form a graph. Several chemical applications of graphs and the connection between graph theory and chemistry have been reported in [2-5]. In the graph-theoretical representation of a molecule, we can study various biological activities, physical properties, chemical reactivities and other properties of chemical compounds. In the area of CGT, a topological index (also known as a graph-theoretic index or connectivity index) specifies the properties of a molecular structure. Generally, it is a numerical representation of a molecule, which is used in the development of Quantitative Structure Activity Relationships (QSARs) and Quantitative Structure Property Relationships (QSPRs). For more details please refer to [6,7].

The topological indices are usually partitioned into degree-based topological indices [8], distance-based topo-logical indices [9], degree and distance-based topological indices [10] and counting related topological indices [11]. These indices describe the physical, biological, chemical and other properties of various structures. Generally, by the definitions of the respective topological indices, we can calculate their numeric values. Instead, a general method can be found to directly produce the different topological indices of a particular class. Keeping this idea in mind, the concept of polynomials [12] is introduced in graph theory. By constructing a general polynomial corresponding to a given structure, one can derive several topological indices by differentiating or integrating (or a different combination of both) the corresponding polynomial.

In literature, several such polynomials are proposed. Some of which are the matching polynomial [13], the Clar covering polynomial (also known as the Zhang-Zhang polynomial) [14], the Schultz polynomial [15], the Tutte polynomial [16], the Hosoya polynomial [17], etc. Among all of these polynomials, the Hosoya polynomial is used for finding the distance-based topological indices such as the Wiener index [18].

The degree-based topological indices play a major role to understand various properties of a molecular structure. In the recent studies, the idea of M-polynomial is proposed by Deutsch and KlavZar [19] and determined how to evaluate several degree-based topological indices. Please refer to the papers [20-24], in each of which the M-polynomial corresponding to a chemical network is derived and henceforth their related degree-based topological indices are evaluated.

Definition 1 ([19]). For a simple connected graph G, the expression

M(G; x,y)= ^ mij (G) xiyj

S<i<j<A

is known as the M-polynomial of a graph G, where 5 = min{d(u)\u e V(G)}, A = max{d(u)\u e V(G)} and mi,j (G) is the number of edges uv e E (G) such that d(u) = i, d(v) = j (i,j > 1).

A degree-based topological index of a graph G is one of a kind of graph invariants, which is denoted as I(G) and as discussed in [25], it can be written as:

I (G) = £ mij (G)f (i,j).

i<j

Theorem 2 ([19], Theorems 2.1, 2.2). Let G be a simple connected graph.

(1) If I (G) = £ f (d(u), d(v)), where f (x, y) is a polynomial in x and y, then

e=uveE(G)

I(G) = f (Dx, Dy)(M(G; x,y))\x=y=i.

(2) If I(G) = Yh f (d(u), d(v)), where f (x,y) = £ ai,jxiyj, then I(G) can be obtained from

e=uveE(G) i,jeZ

M(G; x, y) using the operators Dx, Dy, Sx, and Sy.

xr ys

(3) If I (G) = J2 f (d(u), d(v)), where f (x, y) = --—, where r,s > 0, t > 1 and a e Z, then

e=uv eE(G) (x + y + a)t

I(G) = SxQaJDrxDsy(M(G; x,y))\x=i. 1.2. Associated degree-based topological indices

In this section, we discuss a brief about certain degree-based topological indices that can be derived from the M-polynomial of our considered network. Gutman and Trinajstic [26] proposed the Zagreb indices in 1972. These indices help in determining the total n-electron energy which is related to the thermodynamic stability of a molecule. The Zagreb indices give higher weightage to the inner edges and vertices rather than the outer edges and vertices. With the opposite intuition, the definitions of modified Zagreb indices are proposed in [27].

Table 1. Formula for degree-based topological indices of a graph G

Sl. No. Topological Index Notation Formula of Topological Indices

1. First Zagreb Index [26] Mt(G) Mi(G)= J2 (d(u)+ d(v)) uveE(G)

2. Second Zagreb Index [26] M2(G) M2(G) = Y. (d(u)d(v)) uveE(G)

3. Modified Second Zagreb Index [27] mM2(G) M2(G) = E d(u)d(v) uvEE(G)

4. General Randic Index [28] Ra(G) Ra(G) = £ (d(u)d(v))a uveE(G)

5. Inverse Randic Index [29] RRa(G) RRa(G) = £ (d(u)d(v))a uveE(G)

6. Symmetric Division (Deg) Index [30] SDD(G) SDD(G) = V J min(d(u),d(v)) max(d(u),d(v)) 1 SDD(G) = uv2e \ max(d(u),d(v)) 1 min(d(u),d(v)) J

7. Harmonic Index [31] H (G) H(G) = ^^ d(u) + d(v) uveE(G)

8. Inverse Sum (Indeg) Index [30] ISI(G) rSr(G) = Y^ d(u)d(v) ISI(G) = uMiG) d(u) + dvv)

9. Augmented Zagreb Index [32] AZ (G) AZ (G)= £ [d^SlX uveE(G){ J

Another very well-known degree-based topological index is the Randic index. It is introduced by Milan Randic [33] in 1975. It is also known as a connectivity index or branching index. This index has wide applications in the field of drug design. Two decades later, observing the advancement of Randic index, the mathematicians Bollobas and Erdos [28], and Amic et al. [29] introduced the generalized version of the Randic index (for an arbitrary real number a) in 1998, which is known as general Randic index. For a = --, Ra becomes a Randic index [33]; for a = 1, Ra becomes a second Zagreb index; and for a = -1, Ra turns out to be a modified second Zagreb index. Around 2010, the symmetric division (deg) index is proposed in [30] to determine the total surface area of polychlorobiphenyls. Whereas, the inverse sum (indeg) index [30,34] predicts the total surface area of octane isomers. For the study of the heat of formation of alkanes, the augmented Zagreb index [32] is beneficial. Table 1 lists the formulas of the different degree-based topological indices (of a graph G) which are associated with M-polynomial.

1.3. The hex-derived network of type 3 of dimension n

The Hexagonal network of dimension n is introduced in [35] and is denoted by HX[n]. It has several applications in the image processing to model the benzenoid hydrocarbons in the field of chemistry, wireless sensor networks and computer graphics. Later in 2008, the hex-derived network of type 1 (HDN1) and hex-derived network of type 2 (HDN2) of dimension n (where n denotes the number of vertices in a side of the HDN structure) are constructed from the HX[n] [36]. Again in 2017, based on the structure of the HX[n], Raj and George [37] have derived a new network called hex-derived network of type 3 of dimension n (denoted as HDN3[n]). Fig. 1 depicts the pictorial representation of the third type of hex-derived network of dimension 4 (that is, HDN3[4]). The metric dimension of HDN3[n] has a wide range of applications in robotics, networking etc.

Fig. 1. Type 3 hex-derived network of dimension 4 (HDN3[4])

1.4. Our contribution and roadmap

Recently, Wei et. al. [38] computed several degree-based topological indices of HDN3[n]. The indices are calculated separately as well as directly by using their degree-based formulas mentioned in Table 1. As an alternative of the above, we derive a closed-form of M-polynomial for the HDN3[n] in Section 2. Henceforward, we calculate the related degree-based topological indices of the network (for different values of n) via using the M-polynomial. Moreover, the graphical representation of the M-polynomial and related topological indices for different dimensions of the network are plotted in Section 3.

2. Deriving a M-polynomial for HDN3[n] network

Theorem 3. Let HDN3[n] be the third type of hex-derived network of dimension n (> 4). Then a M-polynomial of HDN3[n] is

M(HDN3[n]; x, y) = (18n2 - 36n +18)x4y4 + 24x4y7 + (36n - 72)x4y10 + (36n2 - 108n + 84)x4y18 + 12x 7y10 + 6x7y18 + (6n - 18)x10y10 + (12n - 24)x10y18 + (9n2 - 33n + 30)x18y18.

Proof. Let us first enumerate the cardinality of the vertex set and the edge set of the HDN3[n] by observing the Fig. 1 of HDN3[4].

|V(HDN3[n])| = 21n2 - 39n +19, and |E(HDN3[n])| = 63n2 - 123n + 60.

Observe that, based on the degree of vertices of HDN3[n], the network consists of 4, 7, 10 and 18 degrees vertices only, and each of whose cardinality is 18(n - 1)2, 6, 6(n - 2) and 3n2 - 9n + 7, respectively. Also, we partition the edge set E(HDN3[n]) of HDN3[n] into nine disjoint sub-classes depending on the degrees of the end vertices of each edge, as: E{ij} = {e = uv G E(HDN3[n]) : d(u) = i,d(v) = j} where {i,j} = {4,4}, {4, 7}, {4,10}, {4,18}, {7,10}, {7,18}, {10,10}, {10,18}, {18,18}. And the cardinality of each of the above edge sets is given by |E{4,4} | = 18n2 - 36n + 18, |E{4j7} | = 24, |E{4,iq} | = 36n - 72, |E{4,18} | = 36n2 - 108n + 84, |E{7j1q} | = 12, |e{7,!}} | = 6, |E{1Qi1Q}| = 6n - 18, |E{1Qi18}| = 12n - 24, |E{18,18}|' = 9n2 - 33n + 30. Observe that the hex-derive network structure does not have any edge uv such that d(u) = 7 = d(v) and as a consequence |E{7j7} | = 0. Therefore, by the basic definition of M-polynomial, the M-polynomial of HDN3[n] is

M(HDN3[n]; x,y)

mi,jxV, where i, j G {4,7,10,18}

i<j

= |E{4,4}| x4y4 + |E{4,7}| x4y7 + |E{4,1Q}| x4y1Q + |E{4,18}| x4y18 + |E{7,10}| x7y1Q + |E{7,18}| x7y18 + |E{ 10,10}| x1Qy1Q + |E{ 10,18}| x1Qy18 + |E{18,18}| x18y18 = (18n2 - 36n + 18) x4y4 + 24 x4y7 + (36n - 72) x4y1Q + (36n2 - 108n + 84) x4y18 + 12 x7y1Q + 6 x7y18 + (6n - 18) x1Qy1Q + (12n - 24) x1Qy18 + (9n2 - 33n + 30) x18y18.

□

Table 2. Formulas for degree-based topological indices derived from the M-polynomial of a graph G

Sl. No. Topological Index Notation f(x,y) Derivation from (M(G; x, y))

1. First Zagreb Index Mi(G) x + y (Dx + Dy )(M (G; x,y))|x=y=i

2. Second Zagreb Index M2(G) xy (DxDy )(M (G; x,y))|x=y=i

3. Modified Second Zagreb Index m M2(G) 1 xy (SxSy )(M (G; x, y)) | x=y=i

4. General Randic Index Ra(G) (xy)a (DaD^)(M (G; x,y))|x=y=i

5. Inverse Randic Index RRa (G) 1 (xy)a (S^Sya)(M(G; x,y))|x=y=i

6. Symmetric Division (Deg) Index SDD(G) x2 + y2 xy (DxSy + Dy Sx)(M (G; x, y)) |x=y=i

7. Harmonic Index H (G) 2 x + y 2SxJ(M(G; x, y)) |x=i

8. Inverse Sum (Indeg) Index ISI(G) xy x + y SxJDxDy (M (G; x,y))|x=i

9. Augmented Zagreb Index AZ (G) ( xy Vx+y-2/ S3Q-2JD3D3(M(G; x,y))|x=i

To calculate the concerned topological indices (as mentioned in Table 1) of a given graph G from the M(G; x, y), the formulas of derivations in terms of integral or derivative (or both integral and derivative) are listed in Table 2 [19],

where Dx = xf^, Dy = ^ ^, Sx = IQX ^ dt, Sy = /Qy ¿(f1 dt, J (f (x,y)) = f (x,x), and

Qa(f (x, y)) = xaf (x,y), a = 0.

The following theorem determines the values of the related degree-based topological indices of the HDN3[n] from the above proposed M-polynomial M(HDN3[n]; x, y).

Theorem 4. Let HDN3[n] be the third type of hex-derived network of dimension n (> 4). Then (!) M1(HDN3[n]) = 6(210n2 - 482n + 275).

(2) M2(HDN3[n]) = 12(483n2 - 1237n + 777).

(3) mM2(HDN3[n]) = —(I8n2 - 36n +18) + — + —(36n - 72) + — (36n2 - 108n + 84) + — + — +

w A L i) -r ; > ^ 72K ^ ' 70 126

1 , 1 , 1 , 2 N119 2 1907 50921

-(6n - 18) +--(12n - 24) +--(9n2 - 33n + 30) = -n2--n +--.

100v ' 180K ' 324 ' 72 675 37800

(4) Ra(HDN3[n]) = 42a(18n2 - 36n + 18) + 24 x 28a + 40a(36n - 72) + 72a(36n2 - 108n + 84) + 12 x 70a + 6 x 126a + 102a(6n - 18) + 180a(12n - 24) + 182a(9n2 - 33n + 30).

r 1N (18n2 - 36n + 18) 24 (36n - 72) (36n2 - 108n + 84) 12 6

(5) RRa(HDN3[n]) = (--1 + — + ( 40a ) + (-^-) + ^ + ^ +

(6n - 18) (12n - 24) (9n2 - 33n + 30)

102a + 180° + 182"- .

2 1510 30487

(6) SDD(HDN3[n]) = 224n2--— n + -j^-.

(7) H(HDN3[n]) =2 x [l(18n2 - 36n +18) + 24 + ■1(36n - 72) + ¿(36n2 - 108n + 84) + 12 + 6 +

8 11 14 22 17 25

1 ,„ 1 1 ,„ „ ...... 91 2 4637 15959

— (6n - 18) +--(12n - 24) +--(9n2 - 33n + 30) = — n2--n +

- - - -

20 28 36 11 330 2550

(8) ISI(HDN3[n]) = 2(18n2 - 36n + 18) + 672 + ^°(36n - 72) + 72(36n2 - 108n + 84) + 840 + 756 +

11 14 22 17 25

N 180, ,324, 2 N 2583 2 5637 115452

5(6n - 18) +--(12n - 24) +--(9n2 - 33n + 30) =-n2--n +--.

v ' 28 v ' 36 v ' 11 11 425

46 24 x 283 403 723 12 x 703

(9) AZ(HDN3[n]) = -3 (18n2-36n +18) +-3-+ —(36n-72) + — (36n2 - 108n+84) +-3— +

6 15

6x1263 106,„ , _ 1803 „ 186

-o--1--o (6n - 18) +--g-(12n - 24) +--o(9n2 - 33n + 30).

233 183 - 263 - 343 -

Proof. One can directly derive the above topological indices by applying the respective derivation formulas over the proposed M-polynomial M(HDN3[n]; x, y) as directed in the fifth column of Table 2. These calculations are trivial and hence they are left to the ambitious reader. □

Remark 5. In the paper [38], the general RandiC index is calculated for the HDN3[n] for different values of a. Instead of calculating this index individually, we can simply put these values of a in the above formula of Ra(HDN3[n]) to generate the respective values of the general Randic index.

FIG. 2. The plot of the M-polynomial of HDN3[4] in region -0.5 < x,y < 0.5

Fig . 3. A plot of first Zagreb, second Zagreb, general Randic (a = 1/2), symmetric division (deg), inverse sum (indeg) and augmented Zagreb indices of HDN3[n] for different values of n (4 < n < 8)

Dimension (x-axis)

Fig. 4. A plot of only symmetric division (deg) and inverse sum (indeg) indices of HDN3[n] for different values of n (4 < n < 8)

3. Experimental results related to the M-polynomial

Fig. 2 pictorially models the M-polynomial M(HDN3[4]; x, y) of the hex-derived network of type 3 of dimension 4 (HDN3[4]) in the domain -0.5 < x, y < 0.5, by using Maple™ 13 software.

Additionally, by observing the broad range of values of the degree-based topological indices of HDN3[n] for different dimensional values of n (4 < n < 8), we plot the values of the first Zagreb, second Zagreb, general Randic (a = 1/2), symmetric division (deg), inverse sum (indeg) and augmented Zagreb indices in Fig. 3, and the values of the modified second Zagreb, inverse Randic (a = 1/2) and Harmonic indices in Fig. 5. The curves plotted in the Fig. 3 for the symmetric division (deg) and inverse sum (indeg) indices are almost overlapping and hence separately redrawn in Fig. 4. It is evident from the figures that the values of each of the topological indices are increasing when the dimensions are in increasing order.

Dimension (x-axis)

Fig. 5. A plot of modified second Zagreb, inverse Randic (a = 1/2) and Harmonic indices of

HDN3[n] for different values of n (4 < n < 8)

4. Conclusion

In this paper, we have considered the third type of hex-derived network of dimension n (HDN3[n]) which has several applications in pharmaceutical sciences, electronics and communication networks. Instead of calculating the various degree-based topological indices separately, we have determined a general and closed-form of M-polynomial and thus directly derived the related degree-based topological indices of HDN3[n]. Also, we have graphically represented the M-polynomial, and all the associated topological indices for different dimensions.

References

[1] West D. B. Introduction to Graph Theory. 2nd Edition, Prentice Hall., 2000.

[2] Hammack R., Imrich W., Klavzar S. Handbook of Product Graphs. 2nd Edition, CRC Press, Inc., Boca Raton, FL, USA, 2011.

[3] Estrada E. Randic index, irregularity and complex biomolecular networks. Acta Chimica Slovenica, 2010, 57, P. 597-603.

[4] Garcia-Domenech R., Galvez J., de Julian-Ortiz J. V., Pogliani L. Some new trends in chemical graph theory. Chemical Reviews, 2008,108(3), P. 1127-1169.

[5] Balaban A. T. Chemical applications of graph theory. Mathematical Chemistry. Academic Press., 1976.

[6] Trinajstic N. Chemical Graph Theory. Mathematical Chemistry Series. 2nd edition, CRC Press., 1992.

[7] Gross J. L., Yellen J., Zhang P. Handbook of Graph Theory. Discrete Mathematics and Its Applications. 2nd edition, Chapman and Hall/CRC., 2013.

[8] Gutman I. Degree-based topological indices. Croatica Chemica Acta, 2013, 86(4), P. 351-361.

[9] Balaban A. T. Highly discriminating distance-based topological index. Chemical Physics Letters, 1982, 89(5), P. 399-404.

[10] Pattabiraman K. Degree and distance based topological indices of graphs. Electronic Notes in Discrete Mathematics, 2017, 63, P. 145-159.

[11] Khadikar P. V., Deshpande N. V., Kale P. P., Dobrynin A., Gutman I., Domotor G. The szeged index and an analogy with the wiener index. Journal of Chemical Information and Computer Sciences, 1995, 35(3), P. 547-550.

[12] Gutman I. The acyclic polynomial of a graph. Publications de l'Institut Mathématique, 1977, 22(36) (42), P. 63-69.

[13] Farrell E. J. An introduction to matching polynomials. Journal of Combinatorial Theory, Series B, 1979, 27(1), P. 75-86.

[14] Zhang H., Zhang F. The clar covering polynomial of hexagonal systems I. Discrete Applied Mathematics, 1996, 69(1-2), P. 147-167.

[15] Gutman I. Some relations between distance-based polynomials of trees. Bulletin (Academie serbe des sciences et des arts. Classe des sciences mathématiques et naturelles. Sciences mathématiques), 2005, 30, P. 1-7.

[16] Kauffman L. H. A tutte polynomial for signed graphs. Discrete Applied Mathematics, 1989, 25(1-2), P. 105-127.

[17] Hosoya H. On some counting polynomials in chemistry. Discrete Applied Mathematics, 1988, 19(1-3), P. 239-257.

[18] Wiener H. Structural determination of paraffin boiling points. Journal of the American Chemical Society, 1947, 69(1), P. 17-20.

[19] Deutsch E., Klavzar S. M-polynomial and degree-based topological indices. Iranian Journal of Mathematical Chemistry, 2015, 6(2), P. 93102.

[20] Munir M., Nazeer W., Rafique S., Kang S. M. M-polynomial and degree-based topological indices of polyhex nanotubes. Symmetry, 2016, 8(12), P. 149.

[21] Munir M., Nazeer W., Rafique S., Kang S.M. M-polynomial and related topological indices of nanostar dendrimers. Symmetry, 2016, 8(9), P. 97.

[22] Munir M., Nazeer W., Nizami A.R., Rafique S., Kang S.M. M-polynomial and topological indices of titania nanotubes. Symmetry, 2016, 8(1-9), P. 117.

[23] Kwun Y. C., Munir M., Nazeer W., Rafique S., Kang S. M. M-polynomials and topological indices of V-phenylenic nanotubes and nanotori. Scientific Reports, P. 2017, 7(1), P. 1-9.

[24] Kang S. M., Nazeer W., Zahid M. A., Nizami A. R., Aslam A., Munir M. M-polynomials and topological indices of hex-derived networks. Open Physics, 2018, 16(1), P. 394-403.

[25] Deng H., Yang J., Xia F. A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes. Computers & Mathematics with Applications, 2011, 61(10), P. 3017-3023.

[26] Gutman I., Trinajstic N. Graph theory and molecular orbitals. Total n-electron energy of alternant hydrocarbons. Chemical Physics Letters, 1972, 17(4), P. 535-538.

[27] Milicevic A., Nikolic S., Trinajstic N. On reformulated zagreb indices. Molecular Diversity, 2004, 8, P. 393-399.

[28] Bollobas B., Erdos P. Graphs of extremal weights. Ars Combinatoria, 1998, 50, P. 225-233.

[29] Amic D., Beslo D., Lucic B., Nikolic S., Trinajstic N. The vertex-connectivity index revisited. Journal of Chemical Information and Computer Sciences, 1998, 38(5), P. 819-822.

[30] Vukicevic D., Gasperov M. Bond additive modeling 1. adriatic indices. Croatica Chemica Acta, 2010, 83(3), P. 243-260.

[31] Favaron O., Maheo M., Sacle J. -F. Some eigenvalue properties in graphs (conjectures of graffiti-II). Discrete Mathematics, 1993, 111(1-3), P. 197-220.

[32] Furtula B., Graovac A., Vukicevic D. Augmented zagreb index. Journal of Mathematical Chemistry, 2010, 48(2), P. 370-380.

[33] Randic M. Characterization of molecular branching. Journal of the American Chemical Society, 1975, 97(23), P. 6609-6615.

[34] Sedlar J., Stevanovic D., Vasilyev A. On the inverse sum indeg index. Discrete Applied Mathematics, 2015,184, P. 202-212.

[35] Nocetti F. G., Stojmenovic I., Zhang J. Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Transactions on Parallel and Distributed Systems, 2002, 13(9), P. 963-971.

[36] Manuel P., Bharati R., Rajasingh I., Monica M C. On minimum metric dimension of honeycomb networks. Journal of Discrete Algorithms, 2008, 6(1), P. 20-27.

[37] Raj F. S., George A. On the metric dimension of HDN 3 and PHDN 3. 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI), 2017, P. 1333-1336.

[38] Wei C. -C., Ali H., Binyamin M. A., Naeem M. N., Liu J. -B. Computing degree based topological properties of third type of hex-derived networks. Mathematics, 2019, 7(4), P. 368.