Next Article in Journal
Toric Rings and Ideals of Stable Set Polytopes
Next Article in Special Issue
On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs
Previous Article in Journal
Solvability of the Boussinesq Approximation for Water Polymer Solutions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Degree-Based Topological Indices of Some Derived Networks

1
Department of Mathematics, Government College University, Faisalabad 38023, Pakistan
2
School of Information Science and Technology, Yunnan Normal University, Kunming 650500, China
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(7), 612; https://doi.org/10.3390/math7070612
Submission received: 23 May 2019 / Revised: 22 June 2019 / Accepted: 22 June 2019 / Published: 10 July 2019
(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)

Abstract

:
There are numeric numbers that define chemical descriptors that represent the entire structure of a graph, which contain a basic chemical structure. Of these, the main factors of topological indices are such that they are related to different physical chemical properties of primary chemical compounds. The biological activity of chemical compounds can be constructed by the help of topological indices. In theoretical chemistry, numerous chemical indices have been invented, such as the Zagreb index, the Randić index, the Wiener index, and many more. Hex-derived networks have an assortment of valuable applications in drug store, hardware, and systems administration. In this analysis, we compute the Forgotten index and Balaban index, and reclassified the Zagreb indices, A B C 4 index, and G A 5 index for the third type of hex-derived networks theoretically.

1. Introduction

Topological indices are very useful tools for chemists which are provided by Graph Theory. In a molecular graph, vertices denotes the atoms and edges are represented as chemical bonds in the terms of graph theory. To predict bioactivity of the chemical compounds, the topological indices such as ABC index, Wiener index, Randi c ´ index, Szeged index and Zagreb indices are very useful.
A graph ξ is a tuple, which consists of the n-connected vertex set | V ( ξ ) | and the edge set | E ( ξ ) |. τ ( m ) denotes the degree of a vertex ‘m’ in a graph ξ . A graph can be represented by the polynomials, numeric numbers, a sequence of numbers, or a matrix. Throughout this article, all graphs examined are simple, finite, and connected.
As a chemical descriptor, the topological index has an integer attached to the graph which features the graph, and there is no change under graph automorphism. Previously, interest in the computing chemistry domain has grown in terms of topological descriptors and is mainly associated with the use of unusual quantities, the relationship between the structure property, and the relationship of the structure quantity. The topological indices that are based on distance, degree, and polynomials are some of the main classes of these indices. In a number of these segments, degree-based displayers are widely important and chemical graphs play an integral part in theory and theoretical chemistry.
In this article, we consider some important topological indices and some important derived graphs. We examine their chemical behavior by the help of topological indices. These topological indices are of use to chemists.
Chen et al. [1] gleaned a hexagonal mesh which consists of triangles. Triangle graphs are called oxide graphs in terms of chemistry. We can construct a hexagonal mesh by joining these triangles, as shown in Figure 1. There does not exist any hexagonal mesh whose dimension equals 1. By the joining of six triangles, we make a hexagonal mesh of dimension 2, H X ( 2 ) (see Figure 1 (1)). By putting the triangles around the all sides of H X ( 2 ) , we obtain hexagonal mesh of dimension 3, H X ( 3 ) (see Figure 1 (2)). Furthermore, we assemble the nth hexagonal mesh by putting n triangles around the boundary of each hexagon.

Drawing Algorithm of Third Type of Hex-Derived Networks H D N 3

Step-1: For H D N 3 , we should draw a hexagonal mesh of dimension m.
Step-2: Draw a K 3 graph in each subgraph of K 3 and join all the vertices to the outer vertices of each K 3 . The new graph is called an H D N 3 (see Figure 2) network.
Step-3: By H D N 3 network, we can simply design T H D N 3 (see Figure 3) and R H D N 3 (see Figure 4).
In this paper, ‘ ξ ’ is taken as a simple connected graph and the degree of any vertex m ´ V ( ξ ) is stands for τ ( m ´ ) .
The oldest, most desired and supremely studied degree-based topological index was introduced by Milan Randić and is known as Randić index [2] denoted by R 1 2 ( ξ ) and described as
R 1 2 ( ξ ) = m ´ n ´ E ( ξ ) 1 τ ( m ´ ) τ ( n ´ ) .
The Forgotten index, also called F-index, was discovered by Furtula and Ivan Gutman [3] and described as
F ( ξ ) = m ´ n ´ E ( ξ ) ( ( τ ( m ´ ) ) 2 + ( τ ( n ´ ) ) 2 ) .
In 1982, Balaban [4,5] found another important index known as Balaban index. For a graph ξ of ‘n’ vertices and ‘m’ edges, and is described as
J ( ξ ) = m m n + 2 m ´ n ´ E ( ξ ) 1 τ ( m ´ ) × τ ( n ´ ) .
The reclassified the Zagreb indices which are proposed by Ranjini et al. [6], is of three types. For a graph ξ , it is described as
R e Z G 1 ( ξ ) = m ´ n ´ E ( ξ ) τ ( m ´ ) × τ ( n ´ ) τ ( m ´ ) + τ ( n ´ ) ,
R e Z G 2 ( ξ ) = m ´ n ´ E ( ξ ) τ ( m ´ ) + τ ( n ´ ) τ ( m ´ ) × τ ( n ´ ) ,
R e Z G 3 ( ξ ) = m ´ n ´ E ( ξ ) ( τ ( m ´ ) × τ ( n ´ ) ) ( τ ( m ´ ) + τ ( n ´ ) ) .
The atom-bond connectivity (ABC) index is a useful predictive index in the study of the heat of formation in alkanes [7] and is introduced by Estrada et al. [8].
Ghorbani et al. [9] introduced the A B C 4 index and is described as
A B C 4 ( ξ ) = m ´ n ´ E ( ξ ) S m ´ + S n ´ 2 S m ´ S n ´ .
Graovac et al. [10] introduced the G A 5 index and is described as
G A 5 ( ξ ) = m ´ n ´ E ( ξ ) 2 S m ´ S n ´ ( S m ´ + S n ´ ) .

2. Main Results

Simonraj et al. [11] created the new network which is named as third type of hex-derived networks. Chang-Cheng Wei et al. [12] found some topological indices of certain new derived networks. In this paper, we compute the exact results for all the above descriptors. For these results on different degree-based topological descriptors for a variety of graphs, we recommend [13,14,15,16,17,18,19,20]. For the basic notations and definitions, see [21,22].

2.1. Results for H D N 3 ( m )

In this part, the Forgotten index, Balaban index, reclassified the Zagreb indices, A B C 4 index, and G A 5 index are under consideration for the third type of hex-derived network.
Theorem 1.
Consider the third type of hex-derived network H D N 3 ( m ) ; its Forgotten index is equal to
F ( H D N 3 ( m ) ) = 6 ( 5339 8132 n + 3108 n 2 ) .
Proof. 
Let ξ 1 be the hex-derived network of Type 3, H D N 3 ( m ) shown in Figure 2, where m 4 . The hex derived network ξ 1 has 21 m 2 39 m + 19 vertices and the edge set of ξ 1 is divided into nine partitions based on the degrees of end vertices as shown in Table 1.
Forgotten index can be calculated by using Table 1. Thus, from ( 2 ) , it follows,
F ( ξ 1 ) = 32 | E 1 ( ξ 1 ) | + 65 | E 2 ( ξ 1 ) | + 116 | E 3 ( ξ 1 ) | + 340 | E 4 ( ξ 1 ) | + 149 | E 5 ( ξ 1 ) | + 373 | E 6 ( ξ 1 ) | + 200 | E 7 ( ξ 1 ) | + 424 | E 8 ( ξ 1 ) | + 648 | E 9 ( ξ 1 ) | .
After some calculations, we have the final result
F ( ξ 1 ) = 6 ( 5339 8132 n + 3108 n 2 ) .
 □
In the subsequent theorem, we compute the Balaban index of the third type of hex-derived network, ξ 1 .
Theorem 2.
For the third type of hex-derived network ξ 1 , the Balaban index is equal to
J ( ξ 1 ) = 1 70 ( 43 84 m + 42 m 2 ) ( ( 20 41 m + 21 m 2 ) ( 1595.47 + 7 ( 307 270 2 + 12 5 + 54 10 ) m ) + 210 ( 5 + 3 2 ) m 2 )
Proof. 
Let ξ 1 be the third type of hex-derived network H D N 3 ( m ) . The Balaban index can be calculated by using (3) and with the help of Table 1, we have.
J ( ξ 1 ) = 63 n 2 123 n + 60 43 84 n + 42 n 2 ( 1 4 | E 1 ( ξ 1 ) | + 1 2 7 | E 2 ( ξ 1 ) | + 1 2 10 | E 3 ( ξ 1 ) | + 1 6 2 | E 4 ( ξ 1 ) | + 1 70 | E 5 ( ξ 1 ) | + 1 3 14 | E 6 ( ξ 1 ) | + 1 10 | E 7 ( ξ 1 ) | + 1 6 5 | E 8 ( ξ 1 ) | + 1 18 | E 9 ( ξ 1 ) | ) .
After some calculations, we have the result
J ( ξ 1 ) = 1 70 ( 43 84 m + 42 m 2 ) ( ( 20 41 m + 21 m 2 ) ( 1595.47 + 7 ( 307 270 2 + 12 5 + 54 10 ) m ) + 210 ( 5 + 3 2 ) m 2 ) .
 □
Now, we compute R e Z G 1 , R e Z G 2 and R e Z G 3 indices of the third type of hex-derived network ξ 1 .
Theorem 3.
Let ξ 1 be the third type of hex-derived network, then
  • R e Z G 1 ( ξ 1 ) = 19 39 m + 21 m 2 ,
  • R e Z G 2 ( ξ 1 ) = 115452 425 5637 m 11 + 2583 m 2 11 ,
  • R e Z G 3 ( ξ 1 ) = 12 ( 27381 38996 m + 13692 m 2 ) .
Proof. 
Reclassified Zagreb index can be calculated by using Table 1, the ReZ G 1 ( ξ 1 ) by using Equation (4) as follows.
R e Z G 1 ( ξ 1 ) = 2 | E 1 ( ξ 1 ) | + 28 11 | E 2 ( ξ 1 ) | + 20 7 | E 3 ( ξ 1 ) | + 36 11 | E 4 ( ξ 1 ) | + 70 17 | E 5 ( ξ 1 ) | + 126 25 | E 6 ( ξ 1 ) | + 5 | E 7 ( ξ 1 ) | + 45 7 | E 8 ( ξ 1 ) | + 9 | E 9 ( ξ 1 ) | .
After some calculations, we have
R e Z G 1 ( ξ 1 ) = 19 39 m + 21 m 2 .
The ReZG 2 ( ξ 1 ) can be calculated by using ( 5 ) as follows.
R e Z G 2 ( ξ 1 ) = 1 2 | E 1 ( ξ 1 ) | + 11 28 | E 2 ( ξ 1 ) | + 7 20 | E 3 ( ξ 1 ) | + 11 36 | E 4 ( ξ 1 ) | + 17 70 | E 5 ( ξ 1 ) | + 25 126 | E 6 ( ξ 1 ) | + 1 5 | E 7 ( ξ 1 ) | + 7 45 | E 8 ( ξ 1 ) | + 1 9 | E 9 ( ξ 1 ) | .
After some calculations, we have
R e Z G 2 ( ξ 1 ) = 115452 425 5637 m 11 + 2583 m 2 11 .
The ReZG 3 ( ξ 1 ) index can be calculated from (6) as follows.
R e Z G 3 ( ξ 1 ) = m ´ n ´ E ( ξ 1 ) ( τ ( m ´ ) × τ ( n ´ ) ) ( τ ( m ´ ) + τ ( n ´ ) = m ´ n ´ E j ( ξ 1 ) j = 1 9 ( τ ( m ´ ) × τ ( n ´ ) ) ( τ ( m ´ ) + τ ( n ´ ) )
R e Z G 3 ( ξ 1 ) = 128 | E 1 ( ξ 1 ) | + 308 | E 2 ( ξ 1 ) | + 560 | E 3 ( ξ 1 ) | + 1584 | E 4 ( ξ 1 ) | + 1190 | E 5 ( ξ 1 ) | + 3150 | E 6 ( ξ 1 ) | + 2000 | E 7 ( ξ 1 ) | + 5040 | E 8 ( ξ 1 ) | + 11664 | E 9 ( ξ 1 ) | .
After some calculations, we have
R e Z G 3 ( ξ 1 ) = 12 ( 27381 38996 m + 13692 m 2 ) .
 □
Now, we find A B C 4 and G A 5 indices of third type of hex-derived network ξ 1 .
Theorem 4.
Let ξ 1 be the third type of hex-derived network, then
  • A B C 4 ( ξ 1 ) = 51.706 + 3 20 79 2 ( 5 + m ) + 3 53 70 ( 4 + m ) + 3 5 109 14 ( 4 + m ) + 114 5 ( 4 + m ) + 3 35 139 2 ( 4 + m ) + 3 14 65 ( 3 + m ) + 12 26 55 ( 3 + m ) + 2 174 35 ( 3 + m ) + 62 7 ( 3 + m ) + 78 11 ( 2 + m ) + 9 11 43 2 ( 2 + m ) 2 + 1 3 35 2 ( 5 + 2 m ) + 1 26 155 2 ( 24 17 m + 3 m 2 ) + 3 6 13 ( 19 15 m + 3 m 2 ) ;
  • G A 5 ( ξ 1 ) = 315.338 + 288 29 5 ( 4 + m ) + 48 11 7 ( 4 + m ) + 16 9 35 ( 4 + m ) + 9 2 7 ( 3 + m ) + 36 11 35 ( 3 + m ) + 48 23 385 ( 3 + m ) + 12 37 1365 ( 3 + m ) + 18 5 11 ( 2 + m ) 99 m + 27 m 2 + 12 25 429 ( 19 15 m + 3 m 2 ) .
Proof. 
The A B C 4 ( ξ 1 ) index can be calculated by using ( 7 ) and by Table 2, as follows.
A B C 4 ( ξ 1 ) = 2 5 14 33 | E 10 ( ξ 1 ) | + 59 30 | E 11 ( ξ 1 ) | + 1 15 77 6 | E 12 ( ξ 1 ) | + 36 11 2 77 | E 13 ( ξ 1 ) | + 1 6 31 14 | E 14 ( ξ 1 ) | + 1 14 103 11 | E 15 ( ξ 1 ) | + 1 4 53 70 | E 16 ( ξ 1 ) | + 1 6 67 33 | E 17 ( ξ 1 ) | + 1 9 85 22 | E 18 ( ξ 1 ) | + 4 3 10 473 | E 19 ( ξ 1 ) | + 1 18 32 2 | E 20 ( ξ 1 ) | + 1 2 13 66 | E 21 ( ξ 1 ) | + 1 2 37 231 | E 22 ( ξ 1 ) | + 1 4 19 30 | E 23 ( ξ 1 ) | + 1 6 163 129 | E 24 ( ξ 1 ) | + 1 2 29 210 | E 25 ( ξ 1 ) | + 1 22 43 2 | E 26 ( ξ 1 ) | + 1 2 57 473 | E 27 ( ξ 1 ) | + 1 2 13 110 | E 28 ( ξ 1 ) | + 1 2 3 26 | E 29 ( ξ 1 ) | + 1 3 43 154 | E 30 ( ξ 1 ) | + 1 9 181 86 | E 31 ( ξ 1 ) | + 1 4 31 77 | E 32 ( ξ 1 ) | + 2 17 3311 | E 33 ( ξ 1 ) | + 1 14 43 11 | E 34 ( ξ 1 ) | + 1 40 79 2 | E 35 ( ξ 1 ) + 1 20 109 14 | E 36 ( ξ 1 ) | + 1 2 99 1505 | E 37 ( ξ 1 ) + 1 6 283 559 | E 38 ( ξ 1 ) | + 1 70 139 2 | E 3 9 ( ξ 1 ) | + 1 2 7 130 | E 40 ( ξ 1 ) | + 1 78 155 2 | E 41 ( ξ 1 ) | .
After some calculations, we have
A B C 4 ( ξ 1 ) = 51.706 + 3 20 79 2 ( 5 + m ) + 3 53 70 ( 4 + m ) + 3 5 109 14 ( 4 + m ) + 114 5 ( 4 + m ) + 3 35 139 2 ( 4 + m ) + 3 14 65 ( 3 + m ) + 12 26 55 ( 3 + m ) + 2 174 35 ( 3 + m ) + 62 7 ( 3 + m ) + 78 11 ( 2 + m ) + 9 11 43 2 ( 2 + m ) 2 + 1 3 35 2 ( 5 + 2 m ) + 1 26 155 2 ( 24 17 m + 3 m 2 ) + 3 6 13 ( 19 15 m + 3 m 2 ) .
The G A 5 ( ξ 1 ) index can be determined from (8) as follows.
G A 5 ( ξ 1 ) = 5 29 33 | E 10 ( ξ 1 ) | + 60 11 | E 11 ( ξ 1 ) | + 30 79 6 | E 12 ( ξ 1 ) | + 5 51 77 | E 13 ( ξ 1 ) | + 3 8 7 | E 14 ( ξ 1 ) | + 4 15 11 | E 15 ( ξ 1 ) | + 4 27 35 | E 16 ( ξ 1 ) | + 4 23 33 | E 17 ( ξ 1 ) | + 6 29 22 | E 18 ( ξ 1 ) | + 1 31 957 | E 19 ( ξ 1 ) | + | E 20 ( ξ 1 ) | + 3 10 11 | E 21 ( ξ 1 ) | + 12 113 77 | E 22 ( ξ 1 ) | + 12 29 5 | E 23 ( ξ 1 ) | + 4 55 129 | E 24 ( ξ 1 ) | + 3 22 35 | E 25 ( ξ 1 ) | + | E 26 ( ξ 1 ) | + 4 173 1419 | E 27 ( ξ 1 ) | + 1 23 385 | E 28 ( ξ 1 ) | + 1 25 429 | E 29 ( ξ 1 ) | + 6 131 462 | E 30 ( ξ 1 ) | + 6 61 86 | E 31 ( ξ 1 ) | + 8 157 385 | E 32 ( ξ 1 ) | + 1 103 9933 | E 33 ( ξ 1 ) | + 4 31 55 | E 34 ( ξ 1 ) | + | E 35 ( ξ 1 ) + 4 11 7 | E 36 ( ξ 1 ) | + 4 269 4515 | E 37 ( ξ 1 ) | + 4 95 559 | E 38 ( ξ 1 ) | + | E 39 ( ξ 1 ) | + 1 37 1365 | E 40 ( ξ 1 ) | + | E 41 ( ξ 1 ) | .
After some calculations, we have
G A 5 ( ξ 1 ) = 315.338 + 288 29 5 ( 4 + m ) + 48 11 7 ( 4 + m ) + 16 9 35 ( 4 + m ) + 9 2 7 ( 3 + m ) + 36 11 35 ( 3 + m ) + 48 23 385 ( 3 + m ) + 12 37 1365 ( 3 + m ) + 18 5 11 ( 2 + m ) 99 m + 27 m 2 + 12 25 429 ( 19 15 m + 3 m 2 ) .
 □

2.2. Results for Third Type of Triangular Hex-Derived Network T H D N 3 ( m )

Now, we discuss the third type of rectangular hex-derived network and compute exact results for Forgotten index and Balaban index, and reclassified the Zagreb indices, A B C 4 index, and G A 5 index for T H D N 3 ( m ) .
Theorem 5.
Consider the third type of triangular hex-derived network of T H D N 3 ( n ) ; its Forgotten index is equal to
F ( T H D N 3 ( m ) ) = 12 ( 990 997 m + 259 m 2 ) .
Proof. 
Let ξ 2 be the third type of triangular hex-derived network, T H D N 3 ( m ) shown in Figure 3, where m 4 . The third type of triangular hex-derived network ξ 2 has 7 m 2 11 m + 6 2 vertices and the edge set of ξ 2 is divided into six partitions based on the degree of end vertices as shown in Table 3.
By using edge partition from Table 3, we get. Thus, from ( 2 ) it follows that
F ( ξ 2 ) = 32 | E 1 ( ξ 2 ) | + 116 | E 2 ( ξ 2 ) | + 340 | E 3 ( ξ 2 ) | + 200 | E 4 ( ξ 2 ) | + 424 | E 5 ( ξ 2 ) | + 648 | E 6 ( ξ 2 ) | .
By doing some calculations, we get
F ( ξ 2 ) = 12 ( 990 997 m + 259 m 2 ) .
 □
In the following theorem, we compute the Balaban index of the third type of triangular hex-derived network, ξ 2 .
Theorem 6.
For the third type of triangular hex-derived network ξ 2 , the Balaban index is equal to
J ( ξ 2 ) = 1 40 ( 8 14 m + 7 m 2 ) ( 6 13 m + 7 m 2 ) ( 159 + 1802 2 36 5 90 10 + ( 107 150 2 + 12 5 + 54 10 ) m + 10 ( 5 + 3 2 ) m 2 ) .
Proof. 
Let ξ 2 be the third type of triangular hex-derived network T H D N 3 ( m ) . By using edge partition from Table 3, the result follows. The Balaban index can be calculated by using (3) as follows.
J ( ξ 2 ) = 3 2 6 13 m + 7 m 2 8 14 m + 7 m 2 ( 1 4 | E 1 ( ξ 2 ) | + 1 2 10 | E 2 ( ξ 2 ) | + 1 6 2 | E 3 ( ξ 2 ) | + 1 10 | E 4 ( ξ 2 ) | + 1 6 5 | E 5 ( ξ 2 ) | + 1 18 | E 6 ( ξ 2 ) | ) .
After some calculation, we have
J ( ξ 2 ) = 1 40 ( 8 14 m + 7 m 2 ) ( 6 13 m + 7 m 2 ) ( 159 + 1802 2 36 5 90 10 + ( 107 150 2 + 12 5 + 54 10 ) m + 10 ( 5 + 3 2 ) m 2 ) .
 □
Now, we compute R e Z G 1 , R e Z G 2 and R e Z G 3 indices of third type of triangular hex-derived network ξ 2 .
Theorem 7.
Let ξ 2 be the third type of triangular hex-derived network, then
  • R e Z G 1 ( ξ 2 ) = 3 154 ( 3408 5117 m + 2009 m 2 ) ,
  • R e Z G 2 ( ξ 2 ) = 1 2 ( 6 11 m + 7 m 2 ) ,
  • R e Z G 3 ( ξ 2 ) = 24 ( 6192 5185 m + 1141 m 2 ) .
Proof. 
By using edge partition given in Table 3, the ReZG 1 ( ξ 2 ) can be calculated by using ( 4 ) as follows.
R e Z G 1 ( ξ 2 ) = 2 | E 1 ( ξ 2 ) | + 20 7 | E 2 ( ξ 2 ) | + 36 11 | E 3 ( ξ 2 ) | + 5 | E 4 ( ξ 2 ) | + 45 7 | E 5 ( ξ 2 ) | + 9 | E 6 ( ξ 2 ) | .
After some calculation, we have
R e Z G 1 ( ξ 2 ) = 3 154 ( 3408 5117 m + 2009 m 2 ) .
The ReZG 2 ( ξ 2 ) can be calculated by using ( 5 ) as follows.
R e Z G 2 ( ξ 2 ) = 1 2 | E 1 ( ξ 2 ) | + 7 20 | E 2 ( ξ 2 ) | + 11 36 | E 3 ( ξ 2 ) | + 1 5 | E 4 ( ξ 2 ) | + 7 45 | E 5 ( ξ 2 ) | + 1 9 | E 6 ( ξ 2 ) | .
After some calculation, we have
R e Z G 2 ( ξ 2 ) = 1 2 ( 6 11 m + 7 m 2 ) .
The ReZG 3 ( ξ 2 ) index can be calculated from (6) as follows.
R e Z G 3 ( ξ 2 ) = 128 | E 1 ( ξ 2 ) | + 560 | E 2 ( ξ 2 ) | + 1584 | E 3 ( ξ 2 ) | + 2000 | E 4 ( ξ 2 ) | + 5040 | E 5 ( ξ 2 ) | + 11664 | E 6 ( ξ 2 ) | .
After some calculation, we have
R e Z G 3 ( ξ 2 ) = 24 ( 6192 5185 m + 1141 m 2 ) .
 □
Now, we compute A B C 4 and G A 5 indices of third type of triangular hex-derived network ξ 2 .
Theorem 8.
Let ξ 2 be the third type of triangular hex-derived network, then
  • A B C 4 ( ξ 2 ) = 24.131 + 3 7 130 ( 6 + m ) + 6 26 55 ( 5 + m ) + 174 35 ( 5 + m ) + 3 10 109 14 ( 5 + m ) + 3 40 79 2 ( 5 + m ) + 3 70 139 2 ( 5 + m ) + 3 2 53 70 ( 4 + m ) + 39 22 ( 4 + m ) + 57 10 ( 4 + m ) + 3 22 43 2 ( 4 + m ) 2 + 1 3 35 2 ( 3 + m ) + 2 7 11 ( 2 + m ) + 1 52 155 2 ( 42 13 m + m 2 ) + 3 3 26 ( 30 11 m + m 2 ) ;
  • G A 5 ( ξ 2 ) = 110.66 + 6 37 1365 ( 6 + m ) + 24 11 7 ( 5 + m ) + 18 11 35 ( 5 + m ) + 24 23 385 ( 5 + m ) + 144 29 5 ( 4 + m ) + 9 5 11 ( 4 + m ) + 8 9 35 ( 4 + m ) + 36 29 22 ( 2 + m ) 12 m + 3 m 2 + 3 2 ( 42 13 m + m 2 ) + 6 25 429 ( 30 11 m + m 2 ) .
Proof. 
By using the edge partition given in Table 4, the A B C 4 ( ξ 2 ) index can be calculated by using ( 7 ) as follows.
A B C 4 ( ξ 2 ) = 1 11 21 2 | E 7 ( ξ 2 ) | + 6 77 | E 8 ( ξ 2 ) | + 1 3 7 11 | E 9 ( ξ 2 ) | + 1 11 43 6 | E 10 ( ξ 2 ) | + 23 462 | E 11 ( ξ 2 ) | + 1 4 53 70 | E 12 ( ξ 2 ) | + 1 18 32 2 | E 13 ( ξ 2 ) | + 1 2 13 66 | E 14 ( ξ 2 ) | + 5 3 1 6 | E 15 ( ξ 2 ) | + 1 4 19 30 | E 16 ( ξ 2 ) | + 1 6 79 62 | E 17 ( ξ 2 ) | + 1 2 29 210 | E 18 ( ξ 2 ) | + 1 22 43 2 | E 19 ( ξ 2 ) | + 1 2 83 682 | E 20 ( ξ 2 ) | + 1 2 13 110 | E 21 ( ξ 2 ) | + 1 2 3 26 | E 22 ( ξ 2 ) | + 1 33 65 2 | E 23 ( ξ 2 ) | + 3 110 | E 24 ( ξ 2 ) | + 47 2046 | E 25 ( ξ 2 ) | + 1 40 79 2 | E 26 ( ξ 2 ) | + 1 4 101 310 | E 27 ( ξ 2 ) | + 1 20 109 14 | E 28 ( ξ 2 ) | + 1 2 131 2170 | E 29 ( ξ 2 ) | + 1 70 139 2 | E 30 ( ξ 2 ) | + 1 2 7 130 | E 31 ( ξ 2 ) | + 1 78 155 2 | E 32 ( ξ 2 ) | .
After some calculation, we have
A B C 4 ( ξ 2 ) = 24.131 + 3 7 130 ( 6 + m ) + 6 26 55 ( 5 + m ) + 174 35 ( 5 + m ) + 3 10 109 14 ( 5 + m ) + 3 40 79 2 ( 5 + m ) + 3 70 139 2 ( 5 + m ) + 3 2 53 70 ( 4 + m ) + 39 22 ( 4 + m ) + 57 10 ( 4 + m ) + 3 22 43 2 ( 4 + m ) 2 + 1 3 35 2 ( 3 + m ) + 2 7 11 ( 2 + m ) + 1 52 155 2 ( 42 13 m + m 2 ) + 3 3 26 ( 30 11 m + m 2 ) .
The G A 5 ( ξ 2 ) index can be calculated from (8) as follows.
G A 5 ( ξ 2 ) = 1 | E 7 ( ξ 2 ) | + 2 25 154 | E 8 ( ξ 2 ) | + 6 29 22 | E 9 ( ξ 2 ) | + 1 2 3 | E 10 ( ξ 2 ) | + 2 47 462 | E 11 ( ξ 2 ) | + 4 27 35 | E 12 ( ξ 2 ) | + 1 | E 13 ( ξ 2 ) | + 3 10 11 | E 14 ( ξ 2 ) | + 2 17 66 | E 15 ( ξ 2 ) | + 12 29 5 | E 16 ( ξ 2 ) | + 3 20 31 | E 17 ( ξ 2 ) | + 3 22 35 | E 18 ( ξ 2 ) | + 1 | E 19 ( ξ 2 ) | + 1 21 341 | E 20 ( ξ 2 ) | + 1 23 385 | E 21 ( ξ 2 ) | + 1 25 429 | E 22 ( ξ 2 ) | + 1 | E 23 ( ξ 2 ) | + 4 73 330 | E 24 ( ξ 2 ) | + 2 95 2046 | E 25 ( ξ 2 ) | + 1 | E 26 ( ξ 2 ) | + 4 51 155 | E 27 ( ξ 2 ) | + 4 11 7 | E 28 ( ξ 2 ) | + 1 33 1085 | E 29 ( ξ 2 ) | + 1 | E 30 ( ξ 2 ) | + 1 37 1365 | E 31 ( ξ 2 ) | + 1 | E 32 ( ξ 2 ) | .
After some calculation, we have
G A 5 ( ξ 2 ) = 110.66 + 6 37 1365 ( 6 + m ) + 24 11 7 ( 5 + m ) + 18 11 35 ( 5 + m ) + 24 23 385 ( 5 + m ) + 144 29 5 ( 4 + m ) + 9 5 11 ( 4 + m ) + 8 9 35 ( 4 + m ) + 36 29 22 ( 2 + m ) 12 m + 3 m 2 + 3 2 ( 42 13 m + m 2 ) + 6 25 429 ( 30 11 m + m 2 ) .
 □

2.3. Results for Third Type of Rectangular Hex-Derived Network, R H D N 3 ( m , n )

In this section, we calculate certain degree-based topological indices of the third type of rectangular hex-derived network, R H D N 3 ( m , n ) of dimension m = n . We compute Forgotten index and Balaban index, and reclassified the Zagreb indices, forth version of A B C index, and fifth version of G A index in the coming theorems of R H D N 3 ( m , n ) .
Theorem 9.
Consider the third type of rectangular hex-derived network R H D N 3 ( m ) , its Forgotten index is equal to
F ( R H D N 3 ( m ) ) = 19726 20096 m + 6216 m 2 .
Proof. 
Let ξ 3 be the third type of rectangular hex-derived network, R H D N 3 ( m ) shown in Figure 4, where m = s 4 . The third type of rectangular hex-derived network ξ 3 has 7 m 2 12 m + 6 vertices and the edge set of ξ 3 is divided into nine partitions based on the degree of end vertices as shown in Table 5.
Thus, from ( 2 ) , it follows that.
F ( G ) = m ´ n ´ E ( ξ ) ( ( τ ( m ´ ) ) 2 + ( τ ( n ´ ) ) 2 )
Let ξ 3 be the third type of rectangular hex-derived network, T H D N 3 ( m ) . By using edge partition from Table 5, the result follows.
F ( ξ 3 ) = m ´ n ´ E ( ξ 3 ) ( ( τ ( m ´ ) ) 2 + ( τ ( n ´ ) ) 2 ) = m ´ n ´ E j ( ξ 3 ) j = 1 9 ( ( τ ( m ´ ) ) 2 + ( τ ( n ´ ) ) 2 )
F ( ξ 3 ) = 32 | E 1 ( ξ 3 ) | + 65 | E 2 ( ξ 3 ) | + 116 | E 3 ( ξ 3 ) | + 340 | E 4 ( ξ 3 ) | + 149 | E 5 ( ξ 3 ) | + 373 | E 6 ( ξ 3 ) | + 200 | E 7 ( ξ 3 ) | + 424 | E 8 ( ξ 3 ) | + 648 | E 9 ( ξ 3 ) | .
After some calculation, we have
F ( ξ 3 ) = 19726 20096 m + 6216 m 2 .
 □
In the following theorem, we compute the Balaban index of the third type of rectangular hex-derived network, ξ 3 .
Theorem 10.
For the third type of rectangular hex-derived network ξ 3 , the Balaban index is equal to
J ( ξ 3 ) = 1 315 ( 15 28 m + 14 m 2 ) 7 ( 157 180 2 + 12 5 + 54 10 ) m + 105 ( 5 + 3 2 ) m 2 ) ( 19 40 m + 21 m 2 ) ( 3 ( 280 + 420 2 70 5 + 60 7 231 10 + 5 14 + 6 70 ) ) .
Proof. 
Let ξ 3 be the rectangular hex-derived network R H D N 3 ( m ) . By using edge partition from Table 5, the result follows. The Balaban index can be calculated by using (3) as follows.
J ( ξ 3 ) = m m n + 2 m ´ n ´ E ( ξ 3 ) 1 τ ( m ´ ) × τ ( n ´ ) = m m n + 2 m ´ n ´ E j ( ξ 3 ) j = 1 9 1 τ ( m ´ ) × τ ( n ´ )
J ( ξ 3 ) = 19 40 m + 21 m 2 15 28 m + 14 m 2 ( 1 4 | E 1 ( ξ 3 ) | + 1 2 7 | E 2 ( ξ 3 ) | + 1 2 10 | E 3 ( ξ 3 ) | + 1 6 2 | E 4 ( ξ 3 ) | + 1 70 | E 5 ( ξ 3 ) | + 1 3 14 | E 6 ( ξ 3 ) | + 1 10 | E 7 ( ξ 3 ) | + 1 6 5 | E 8 ( ξ 3 ) | + 1 18 | E 9 ( ξ 3 ) | ) .
After some calculation, we have
J ( ξ 3 ) = 1 315 ( 15 28 m + 14 m 2 ) 7 ( 157 180 2 + 12 5 + 54 10 ) m + 105 ( 5 + 3 2 ) m 2 ) ( 19 40 m + 21 m 2 ) ( 3 ( 280 + 420 2 70 5 + 60 7 231 10 + 5 14 + 6 70 ) ) .
 □
Now, we compute R e Z G 1 , R e Z G 2 and R e Z G 3 indices of the third type of rectangular hex-derived network ξ 3 .
Theorem 11.
Let ξ 3 be the third type of rectangular hex-derived network, then
  • R e Z G 1 ( ξ 3 ) = 10102843 32725 2036 m 11 + 861 m 2 11 ,
  • R e Z G 2 ( ξ 3 ) = 56 12 m + 7 m 2 ,
  • R e Z G 3 ( ξ 3 ) = 4 ( 50785 50608 m + 13692 m 2 ) .
Proof. 
By using the edge partition given in Table 5, the ReZG 1 ( ξ 3 ) can be calculated by using ( 4 ) as follows.
R e Z G 1 ( ξ ) = m ´ n ´ E ( ξ 3 ) τ ( m ´ ) × τ ( n ´ ) τ ( m ´ ) + τ ( n ´ ) = j = 1 9 m ´ n ´ E j ( ξ 3 ) τ ( m ´ ) × τ ( n ´ ) τ ( m ´ ) + τ ( n ´ )
R e Z G 1 ( ξ 3 ) = 2 | E 1 ( ξ 3 ) | + 28 11 | E 2 ( ξ 3 ) | + 20 7 | E 3 ( ξ 3 ) | + 36 11 | E 4 ( ξ 3 ) | + 70 17 | E 5 ( ξ 3 ) | + 126 25 | E 6 ( ξ 3 ) | + 5 | E 7 ( ξ 3 ) | + 45 7 | E 8 ( ξ 3 ) | + 9 | E 9 ( ξ 3 ) | .
After some calculation, we have
R e Z G 1 ( ξ 3 ) = 10102843 32725 2036 m 11 + 861 m 2 11 .
The ReZG 2 ( ξ 3 ) can be calculated by using ( 5 ) as follows.
R e Z G 2 ( ξ 3 ) = m ´ n ´ E ( ξ 3 ) τ ( m ´ ) + τ ( n ´ ) τ ( m ´ ) × τ ( n ´ ) = m ´ n ´ E j ( ξ 3 ) j = 1 9 τ ( m ´ ) + τ ( n ´ ) τ ( m ´ ) × τ ( n ´ )
R e Z G 2 ( ξ 3 ) = 1 2 | E 1 ( ξ 3 ) | + 11 28 | E 2 ( ξ 3 ) | + 7 20 | E 3 ( ξ 3 ) | + 11 36 | E 4 ( ξ 3 ) | + 17 70 | E 5 ( ξ 3 ) | + 25 126 | E 6 ( ξ 3 ) | + 1 5 | E 7 ( ξ 3 ) | + 7 45 | E 8 ( ξ 3 ) | + 1 9 | E 9 ( ξ 3 ) | .
After some calculation, we have
R e Z G 2 ( ξ 3 ) = 56 12 m + 7 m 2 .
The ReZG 3 ( ξ 3 ) index can be calculated from (6) as follows.
R e Z G 3 ( ξ 3 ) = m ´ n ´ E ( ξ 3 ) ( τ ( m ´ ) × τ ( n ´ ) ) ( τ ( m ´ ) + τ ( n ´ ) = m ´ n ´ E j ( ξ 3 ) j = 1 9 ( τ ( m ´ ) × τ ( n ´ ) ) ( τ ( m ´ ) + τ ( n ´ ) )
R e Z G 3 ( ξ 3 ) = 128 | E 1 ( ξ 3 ) | + 308 | E 2 ( ξ 3 ) | + 560 | E 3 ( ξ 3 ) | + 1584 | E 4 ( ξ 3 ) | + 1190 | E 5 ( ξ 3 ) | + 3150 | E 6 ( ξ 3 ) | + 2000 | E 7 ( ξ 3 ) | + 5040 | E 8 ( ξ 3 ) | + 11664 | E 9 ( ξ 3 ) | .
After some calculation, we have
R e Z G 3 ( ξ 3 ) = 4 ( 50785 50608 m + 13692 m 2 ) .
 □
Now, we compute A B C 4 and G A 5 indices of the third type of rectangular hex-derived network ξ 3 .
Theorem 12.
Let ξ 3 be the third type of rectangular hex-derived network, then
  • A B C 4 ( ξ 3 ) = 22.459 + 8 26 55 ( 4 + m ) + 4 58 105 ( 4 + m ) + 4 7 67 15 ( 4 + m ) + 3 6 13 ( 4 + m ) 2 + 2 26 33 ( 3 + m ) + 3 11 43 2 ( 3 + m ) 2 + 14 65 ( 9 + 2 m ) + 1 35 139 2 ( 9 + 2 m ) + 1 3 62 7 ( 5 + 2 m ) + 4 63 31 ( 5 + 2 m ) + 4 9 97 7 ( 3 + 2 m ) + 2 21 89 ( 3 + 2 m ) + 1 9 35 2 ( 11 + 4 m ) + 1 78 155 2 ( 65 28 m + 3 m 2 ) ;
  • G A 5 ( ξ 3 ) = 173.339 + 96 29 5 ( 4 + m ) + 24 11 35 ( 4 + m ) + 32 23 385 ( 4 + m ) + 12 25 429 ( 4 + m ) 2 + 12 5 11 ( 3 + m ) 48 m + 9 m 2 + 4 37 1365 ( 9 + 2 m ) + 3 2 7 ( 5 + 2 m ) + 48 13 ( 3 + 2 m ) + 32 11 7 ( 3 + 2 m ) .
Proof. 
By using the edge partition given in Table 6, the A B C 4 ( ξ 3 ) can be calculated by using ( 7 ) as follows.
A B C 4 ( ξ 3 ) = m ´ n ´ E ( ξ 3 ) S m ´ + S n ´ 2 S m ´ S n ´ = m ´ n ´ E j ( ξ 3 ) j = 10 44 S m ´ + S n ´ 2 S m ´ S n ´
A B C 4 ( ξ 3 ) = 1 11 21 2 | E 10 ( ξ 3 ) | + 6 77 | E 11 ( ξ 3 ) | + 1 3 83 154 | E 12 ( ξ 3 ) | + 1 5 46 33 | E 13 ( ξ 3 ) | + 1 30 59 | E 14 ( ξ 3 ) | + 1 15 77 6 | E 15 ( ξ 3 ) | + 1 15 86 7 | E 16 ( ξ 3 ) | + 1 6 31 14 | E 17 ( ξ 3 ) | + 1 42 89 | E 18 ( ξ 3 ) | + 1 6 67 33 | E 19 ( ξ 3 ) | + 1 9 85 22 | E 20 ( ξ 3 ) | + 4 3 10 473 | E 21 ( ξ 3 ) | + 1 18 35 2 | E 22 ( ξ 3 ) | + 1 2 13 66 | E 23 ( ξ 3 ) | + 1 18 97 7 | E 24 ( ξ 3 ) | + 1 6 79 62 | E 25 ( ξ 3 ) | + 1 6 163 129 | E 26 ( ξ 3 ) | + 1 2 29 210 | E 27 ( ξ 3 ) | + 1 22 43 2 | E 28 ( ξ 3 ) | + 1 2 83 682 | E 29 ( ξ 3 ) | + 1 2 57 473 | E 30 ( ξ 3 ) | + 1 2 13 110 | E 31 ( ξ 3 ) | + 1 2 3 26 | E 32 ( ξ 3 ) + 1 9 115 42 | E 33 ( ξ 3 ) + 1 9 181 86 | E 34 ( ξ 3 ) | + 1 63 31 | E 35 ( ξ 3 ) | + 1 6 185 217 | E 36 ( ξ 3 ) | + 1 3 190 903 | E 37 ( ξ 3 ) | + 1 14 67 15 | E 38 ( ξ 3 ) | + 1 2 131 2170 | E 39 ( ξ 3 ) | + 1 2 89 1505 | E 40 ( ξ 3 ) + 1 70 283 559 | E 41 ( ξ 3 ) + 1 70 139 2 | E 42 ( ξ 3 ) | + 1 2 7 130 | E 43 ( ξ 3 ) | + 1 78 155 2 | E 44 ( ξ 3 ) | .
After some calculation, we have
A B C 4 ( ξ 3 ) = 22.459 + 8 26 55 ( 4 + m ) + 4 58 105 ( 4 + m ) + 4 7 67 15 ( 4 + m ) + 3 6 13 ( 4 + m ) 2 + 2 26 33 ( 3 + m ) + 3 11 43 2 ( 3 + m ) 2 + 14 65 ( 9 + 2 m ) + 1 35 139 2 ( 9 + 2 m ) + 1 3 62 7 ( 5 + 2 m ) + 4 63 31 ( 5 + 2 m ) + 4 9 97 7 ( 3 + 2 m ) + 2 21 89 ( 3 + 2 m ) + 1 9 35 2 ( 11 + 4 m ) + 1 78 155 2 ( 65 28 m + 3 m 2 ) .
The G A 5 ( ξ 3 ) index can be calculated from (8) as follows.
G A 5 ( ξ 3 ) = m ´ n ´ E ( ξ 3 ) 2 S m ´ S n ´ ( S m ´ + S n ´ ) = m ´ n ´ E j ( ξ 3 ) j = 10 44 2 S m ´ S n ´ ( S m ´ + S n ´ )
G A 5 ( ξ 3 ) = 1 | E 10 ( ξ 3 ) | + 2 25 154 | E 11 ( ξ 3 ) | + 6 85 154 | E 12 ( ξ 3 ) | + 5 29 33 | E 13 ( ξ 3 ) | + 60 61 | E 14 ( ξ 3 ) | + 30 79 6 | E 15 ( ξ 3 ) | + 15 44 7 | E 16 ( ξ 3 ) | + 3 8 7 | E 17 ( ξ 3 ) | + 12 13 | E 18 ( ξ 3 ) | + 4 23 33 | E 19 ( ξ 3 ) | + 6 29 22 | E 20 ( ξ 3 ) | + 1 27 473 | E 21 ( ξ 3 ) | + 1 | E 22 ( ξ 3 ) | + 3 10 11 | E 23 ( ξ 3 ) | + 4 11 7 | E 24 ( ξ 3 ) | + 3 20 31 | E 25 ( ξ 3 ) | + 4 55 129 | E 26 ( ξ 3 ) | + 3 22 35 | E 27 ( ξ 3 ) | + | E 28 ( ξ 3 ) | + 1 21 341 | E 29 ( ξ 3 ) | + 4 173 1419 | E 30 ( ξ 3 ) | + 1 23 385 | E 31 ( ξ 3 ) | + 1 25 429 | E 32 ( ξ 3 ) | + 2 13 42 | E 33 ( ξ 3 ) | + 6 61 86 | E 34 ( ξ 3 ) | + 1 | E 35 ( ξ 3 ) | + 12 187 217 | E 36 ( ξ 3 ) | + 1 32 903 | E 37 ( ξ 3 ) | + 12 29 5 | E 38 ( ξ 3 ) | + 1 33 1085 | E 39 ( ξ 3 ) | + 4 269 4515 | E 40 ( ξ 3 ) | + 4 95 559 | E 41 ( ξ 3 ) | + 1 | E 42 ( ξ 3 ) | + 1 37 1365 | E 43 ( ξ 3 ) | + 1 | E 44 ( ξ 3 ) | .
After some calculations, we have
G A 5 ( ξ 3 ) = 173.339 + 96 29 5 ( 4 + m ) + 24 11 35 ( 4 + m ) + 32 23 385 ( 4 + m ) + 12 25 429 ( 4 + m ) 2 + 12 5 11 ( 3 + m ) 48 m + 9 m 2 + 4 37 1365 ( 9 + 2 m ) + 3 2 7 ( 5 + 2 m ) + 48 13 ( 3 + 2 m ) + 32 11 7 ( 3 + 2 m ) .
 □
The graphical representations of topological indices of these networks are depicted in Figure 5 and Figure 6 for certain values of m. By varying the different values of m, the graphs are increasing. These graphs show the correctness of the results.

3. Conclusions

The study of topological descriptors are very useful to acquire the basic topologies of networks. In this paper, we find the exact results for Forgotten index, Balaban index, reclassified the Zagreb indices, ABC 4 index and GA 5 index of the Hex-derived networks of type 3. Due to their fascinating and challenging features, hex-derived networks have studied literature in relation to different graph-ideological parameters. However, their developmental circulatory features have been read for the foremost in this paper.
We are also very keen in designing some new networks and then study their topological indices which will be quite helpful to understand their primary priorities.

Author Contributions

Software, M.A.B.; validation, M.K.S. writing—original draft preparation, H.A.; writing—review and editing, W.G.; supervision, M.K.S.; funding acquisition, W.G.

Funding

This work has been partially supported by National Science Foundation of China (11761083).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chen, M.S.; Shin, K.G.; Kandlur, D.D. Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans. Comput. 1990, 39, 10–18. [Google Scholar] [CrossRef]
  2. Randić, M. On Characterization of molecular branching. J. Am. Chem. Soc. 1975, 97, 6609–6615. [Google Scholar] [CrossRef]
  3. Furtula, B.; Gutman, I. A forgotten topological index. J. Math. Chem. 2015, 53, 1184–1190. [Google Scholar] [CrossRef]
  4. Balaban, A.T. Highly discriminating distance-based topological index. Chem. Phys. Lett. 1982, 89, 399–404. [Google Scholar] [CrossRef]
  5. Balaban, A.T.; Quintas, L.V. The smallest graphs, trees, and 4-trees with degenerate topological index. J. Math. Chem. 1983, 14, 213–233. [Google Scholar]
  6. Ranjini, P.S.; Lokesha, V.; Usha, A. Relation between phenylene and hexagonal squeez using harmonic index. Int. J. Graph Theory 2013, 1, 116–121. [Google Scholar]
  7. Estrada, E. Atom-bond connectivity and the energetic of branched alkanes. Chem. Phys. Lett. 2008, 463, 422–425. [Google Scholar] [CrossRef]
  8. Estrada, E.; Torres, L.; Rodrigueza, L.; Gutman, I. An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J. Chem. 1998, 37, 849–855. [Google Scholar]
  9. Ghorbani, M.; Hosseinzadeh, M.A. Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1419–1422. [Google Scholar]
  10. Graovac, A.; Ghorbani, M.; Hosseinzadeh, M.A. Computing fifth geometric-arithmetic index for nanostar dendrimers. J. Math. Nanosci. 2011, 1, 33–42. [Google Scholar]
  11. Simonraj, F.; George, A. 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, 21–22 September 2017; pp. 1333–1336. [Google Scholar]
  12. 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, 368. [Google Scholar] [CrossRef]
  13. Ali, H.; Sajjad, A. On further results of hex derived networks. Open J. Discret. Appl. Math. 2019, 2(1), 32–40. [Google Scholar]
  14. Bača, M.; Horváthová, J.; Mokrišová, M.; Semaničová-Feňovxcxíkovxax, A.; Suhányiovǎ, A. On topological indices of carbon nanotube network. Can. J. Chem. 2015, 93, 1157–1160. [Google Scholar] [CrossRef]
  15. Baig, A.Q.; Imran, M.; Ali, H. Omega, Sadhana and PI polynomials of benzoid carbon nanotubes, Optoelectron. Adv. Mater. Rapid Commun. 2015, 9, 248–255. [Google Scholar]
  16. Baig, A.Q.; Imran, M.; Ali, H. On Topological Indices of Poly Oxide, Poly Silicate, DOX and DSL Networks. Can. J. Chem. 2015, 93, 730–739. [Google Scholar] [CrossRef]
  17. Imran, M.; Baig, A.Q.; Ali, H. On topological properties of dominating David derived networks. Can. J. Chem. 2015, 94, 137–148. [Google Scholar] [CrossRef]
  18. Imran, M.; Baig, A.Q.; Rehman, S.U.; Ali, H.; Hasni, M. Computing topological polynomials of mesh-derived networks. Discret. Math. Algorithms Appl. 2018, 10, 1850077. [Google Scholar] [CrossRef]
  19. Imran, M.; Baig, A.Q.; Siddiqui, H.M.A.; Sarwar, M. On molecular topological properties of diamond like networks. Can. J. Chem. 2017, 95, 758–770. [Google Scholar] [CrossRef]
  20. Simonraj, F.; George, A. Embedding of poly honeycomb networks and the metric dimension of star of david network. GRAPH-HOC 2012, 4, 11–28. [Google Scholar] [CrossRef]
  21. Diudea, M.V.; Gutman, I.; Lorentz, J. Molecular Topology; Nova Science Publishers: Huntington, NY, USA, 2001. [Google Scholar]
  22. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef]
Figure 1. Hexagonal meshes: (1) HX 2 , (2) HX 3 , and (3), all facing HX 2 .
Figure 1. Hexagonal meshes: (1) HX 2 , (2) HX 3 , and (3), all facing HX 2 .
Mathematics 07 00612 g001
Figure 2. Third type of hex-derived network ( H D N 3 ( 4 ) ).
Figure 2. Third type of hex-derived network ( H D N 3 ( 4 ) ).
Mathematics 07 00612 g002
Figure 3. Third type of triangular hex-derived network ( T H D N 3 ( 7 ) ).
Figure 3. Third type of triangular hex-derived network ( T H D N 3 ( 7 ) ).
Mathematics 07 00612 g003
Figure 4. Third type of rectangular hex-derived network ( R H D N 3 ( 4 , 4 ) ).
Figure 4. Third type of rectangular hex-derived network ( R H D N 3 ( 4 , 4 ) ).
Mathematics 07 00612 g004
Figure 5. Comparison of ABC 4 index for ξ 1 , ξ 2 and ξ 3 .
Figure 5. Comparison of ABC 4 index for ξ 1 , ξ 2 and ξ 3 .
Mathematics 07 00612 g005
Figure 6. Comparison of GA 5 index for ξ 1 , ξ 2 and ξ 3 .
Figure 6. Comparison of GA 5 index for ξ 1 , ξ 2 and ξ 3 .
Mathematics 07 00612 g006
Table 1. Edge partition of third type of hex-derived network H D N 3 ( m ) , based on degrees of end vertices of each edge.
Table 1. Edge partition of third type of hex-derived network H D N 3 ( m ) , based on degrees of end vertices of each edge.
( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges ( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges
( 4 , 4 ) 18 m 2 36 m + 18 ( 7 , 18 ) 6
( 4 , 7 ) 24 ( 10 , 10 ) 6 m 18
( 4 , 10 ) 36 m 72 ( 10 , 18 ) 12 m 24
( 4 , 18 ) 36 m 2 108 m + 84 ( 18 , 18 ) 9 m 2 33 m + 30
( 7 , 10 ) 12--
Table 2. Edge partition of the third type of hex-derived network H D N 3 ( m ) based on sum of degrees of end vertices of each edge.
Table 2. Edge partition of the third type of hex-derived network H D N 3 ( m ) based on sum of degrees of end vertices of each edge.
( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges ( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges
( 25 , 33 ) 12 ( 44 , 44 ) 18 m 2 72 m + 72
( 25 , 36 ) 12 ( 44 , 129 ) 36
( 25 , 54 ) 12 ( 44 , 140 ) 48 m 144
( 25 , 77 ) 12 ( 44 , 156 ) 36 m 2 180 m + 228
( 28 , 36 ) 12 m 36 ( 54 , 77 ) 12
( 28 , 77 ) 12 ( 54 , 129 ) 6
( 28 , 80 ) 12 m 48 ( 77 , 80 ) 12
( 33 , 36 ) 12 ( 77 , 129 ) 12
( 33 , 54 ) 12 ( 77 , 140 ) 12
( 33 , 129 ) 12 ( 80 , 80 ) 6 m 30
( 36 , 36 ) 12 m 30 ( 80 , 140 ) 12 m 48
( 36 , 44 ) 12 m 24 ( 129 , 140 ) 12
( 36 , 77 ) 48 ( 129 , 156 ) 6
( 36 , 80 ) 24 m 96 ( 140 , 140 ) 6 m 24
( 36 , 129 ) 24 ( 140 , 156 ) 12 m 36
( 36 , 140 ) 24 m 72 ( 156 , 156 ) 9 m 2 51 m + 72
Table 3. Edge partition of the third type of triangular hex-derived network T H D N 3 ( m ) based on degrees of end vertices of each edge.
Table 3. Edge partition of the third type of triangular hex-derived network T H D N 3 ( m ) based on degrees of end vertices of each edge.
( τ x , τ y ) Where m ´ n ´ E ( ξ 1 ) Number of Edges ( τ u , τ v ) Where m ´ n ´ E ( ξ 1 ) Number of Edges
( 4 , 4 ) 3 m 2 6 m + 9 ( 10 , 10 ) 3 m 6
( 4 , 10 ) 18 m 30 ( 10 , 18 ) 6 m 18
( 4 , 18 ) 6 m 2 30 m + 36 ( 18 , 18 ) 3 m 2 21 m + 36 2
Table 4. Edge partition of the third type of triangular hex-derived network T H D N 3 ( m ) based on the sum of degrees of end vertices of each edge.
Table 4. Edge partition of the third type of triangular hex-derived network T H D N 3 ( m ) based on the sum of degrees of end vertices of each edge.
( τ x , τ y ) Where m ´ n ´ E ( ξ 2 ) Number of Edges ( τ u , τ v ) Where m ´ n ´ E ( ξ 2 ) Number of Edges
( 22 , 22 ) 3 ( 44 , 124 ) 12
( 22 , 28 ) 12 ( 44 , 140 ) 24 m 120
( 22 , 36 ) 6 ( 44 , 156 ) 6 m 2 66 m + 180
( 22 , 66 ) 6 m 12 ( 66 , 66 ) 3
( 28 , 66 ) 24 ( 66 , 80 ) 6
( 28 , 80 ) 6 m 24 ( 66 , 124 ) 6
( 36 , 36 ) 6 m 18 ( 80 , 80 ) 3 m 15
( 36 , 44 ) 6 m 24 ( 80 , 124 ) 6
( 36 , 66 ) 12 ( 80 , 140 ) 6 m 30
( 36 , 80 ) 12 m 48 ( 124 , 140 ) 6
( 36 , 124 ) 24 ( 140 , 140 ) 3 m 15
( 36 , 140 ) 12 m 60 ( 140 , 156 ) 6 m 36
( 44 , 44 ) 3 m 2 24 m + 48 ( 156 , 156 ) 3 m 2 39 m + 126 2
Table 5. Edge partition of the third type of rectangular hex-derived network, R H D N 3 ( m ) based on degrees of end vertices of each edge.
Table 5. Edge partition of the third type of rectangular hex-derived network, R H D N 3 ( m ) based on degrees of end vertices of each edge.
( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges ( τ m ´ , τ n ´ ) Where m ´ n ´ E ( ξ 1 ) Number of Edges
( 4 , 4 ) 6 m 2 12 m + 10 ( 7 , 18 ) 2
( 4 , 7 ) 8 ( 10 , 10 ) 4 m 10
( 4 , 10 ) 24 m 44 ( 10 , 18 ) 8 m 20
( 4 , 18 ) 12 m 2 48 m + 48 ( 18 , 18 ) 3 m 2 16 m + 21
( 7 , 10 ) 4--
Table 6. Edge partition of the third type of rectangular hex-derived network R H D N 3 ( m ) based on the sum of degrees of end vertices of each edge.
Table 6. Edge partition of the third type of rectangular hex-derived network R H D N 3 ( m ) based on the sum of degrees of end vertices of each edge.
( τ x , τ y ) Where m ´ n ´ E ( ξ 3 ) Number of Edges ( τ u , τ v ) Where m ´ n ´ E ( ξ 3 ) Number of Edges
( 22 , 22 ) 2 ( 44 , 44 ) 6 m 2 36 m + 54
( 22 , 28 ) 8 ( 44 , 124 ) 8
( 22 , 63 ) 4 ( 44 , 129 ) 12
( 25 , 33 ) 4 ( 44 , 140 ) 32 m 128
( 25 , 36 ) 4 ( 44 , 156 ) 12 m 2 96 m + 192
( 25 , 54 ) 4 ( 54 , 63 ) 4
( 25 , 63 ) 4 ( 54 , 129 ) 2
( 28 , 36 ) 8 m 20 ( 63 , 63 ) 4 m 10
( 28 , 63 ) 8 m 12 ( 63 , 124 ) 8
( 33 , 36 ) 4 ( 63 , 129 ) 4
( 33 , 54 ) 4 ( 63 , 140 ) 8 m 32
( 33 , 129 ) 4 ( 124 , 140 ) 4
( 36 , 36 ) 8 m 22 ( 129 , 140 ) 4
( 36 , 44 ) 8 m 24 ( 129 , 156 ) 2
( 36 , 63 ) 16 m 40 ( 140 , 140 ) 4 m 18
( 36 , 124 ) 16 ( 140 , 156 ) 8 m 36
( 36 , 129 ) 8 ( 156 , 156 ) 3 m 2 28 m + 65
( 36 , 140 ) 16 m 64 --

Share and Cite

MDPI and ACS Style

Ali, H.; Binyamin, M.A.; Shafiq, M.K.; Gao, W. On the Degree-Based Topological Indices of Some Derived Networks. Mathematics 2019, 7, 612. https://doi.org/10.3390/math7070612

AMA Style

Ali H, Binyamin MA, Shafiq MK, Gao W. On the Degree-Based Topological Indices of Some Derived Networks. Mathematics. 2019; 7(7):612. https://doi.org/10.3390/math7070612

Chicago/Turabian Style

Ali, Haidar, Muhammad Ahsan Binyamin, Muhammad Kashif Shafiq, and Wei Gao. 2019. "On the Degree-Based Topological Indices of Some Derived Networks" Mathematics 7, no. 7: 612. https://doi.org/10.3390/math7070612

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop