Next Article in Journal
Phytochemicals from Red Onion, Grown with Eco-Sustainable Fertilizers, Protect Mammalian Cells from Oxidative Stress, Increasing Their Viability
Next Article in Special Issue
On Some Topological Indices Defined via the Modified Sombor Matrix
Previous Article in Journal
Encapsulation of Bromelain in Combined Sodium Alginate and Amino Acid Carriers: Experimental Design of Simplex-Centroid Mixtures for Digestibility Evaluation
Previous Article in Special Issue
Hosoya Polynomials of Power Graphs of Certain Finite Groups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Topological Properties for Benzenoid Planar Octahedron Networks

1
School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
2
Department of Mathematics, Riphah International University, Faisalabad 38000, Pakistan
3
Department of Mechanical Engineering, College of Engineering, Qassim University, Unaizah 56452, Saudi Arabia
4
Department of Electrical Engineering, College of Engineering, Qassim University, Unaizah 56452, Saudi Arabia
*
Author to whom correspondence should be addressed.
Molecules 2022, 27(19), 6366; https://doi.org/10.3390/molecules27196366
Submission received: 9 August 2022 / Revised: 11 September 2022 / Accepted: 16 September 2022 / Published: 27 September 2022
(This article belongs to the Special Issue Study of Molecules in the Light of Spectral Graph Theory)

Abstract

:
Chemical descriptors are numeric numbers that capture the whole graph structure and comprise a basic chemical structure. As a topological descriptor, it correlates with certain physical aspects in addition to its chemical representation of underlying chemical substances. In the modelling and design of any chemical network, the graph is important. A number of chemical indices have been developed in theoretical chemistry, including the Wiener index, the Randić index, and many others. In this paper, we look at the benzenoid networks and calculate the exact topological indices based on the degrees of the end vertices.

1. Introduction

Topological indices, which are calculated using graph theory, are important tools. The chemical graph is a subbranch of graph theory with a wide range of applications in chemistry and mathematics. To expect the bioactivity of chemical substances, the topological indices, such as the ABC index, Wiener index, and Randić index, are very useful. A growing field called cheminformatics, which combines mathematics, information science, and chemistry, can be used to study quantitative structure–activity (QSAR) and structure–property (QSPR) relationships that are used to examine the organic activities and characteristics of biological substances. The topological index is a numerical value linked with chemical compositions that suggests a link between a variety of physical qualities and chemical structures that suggest a link between a variety of physical qualities, chemical reactivity, and biological activity. The translation of a chemical network into a number that describes the topology of the chemical network is the basis for topological indices. The topological index is a chemical descriptor that contains an integer associated with the graph that features the graph and does not change during graph automorphism. Interest in the computer chemistry area has already increased in terms of topological descriptors and is mostly related to the usage of uncommon quantities, the connection between structure properties, and the relationship between structure quantity. Some of the most common types of topological indices include those depending on distance, degree, and polynomials. Chemical graphs are commonly used to describe molecules and molecular compounds. A molecular graph provides a good example of the structural formula of chemical compounds in graph theory. Many researchers have recently discovered topological indices to be crucial in the analysis of the structural aspects of molecular graphs, networks, and chemical trees. A tree graph is an acyclic linked graph. The branch point of a tree is defined as any vertex with a degree of three or more.

2. Construction for Benzenoid Planar Octahedron Network BPOH(n)

The algorithm for constructing the benzenoid planar octahedron, benzenoid-dominating planar octahedron, and benzenoid hex planar octahedron networks (of dimension n) is as follows:
Step-1.
We design an n-dimensional oxide network [1].
Step-2.
After that, connect C 6 into each C 3 of the oxide network.
Step-3.
The resultant graph is also known as the benzenoid planar octahedron network. Connect alternating adjacent C 6 vertices to each opposite vertex. The benzenoid-dominating planar octahedron network is represented by B 2 , and the benzenoid hex planar octahedron network is represented by B 3 . The benzenoid-dominating planar octahedron network B D P O H ( n ) and the benzenoid hex planar octahedron network B H P O H ( n ) can be created using this approach (n).
B is considered as a simple connected graph in this article, and the degree of each vertex s V ( B ) is denoted as δ ( s ) .
Milan Randić [2] introduced the oldest, most desired, and most extensively examined degree-based topological index, which is known as the Randić index, denoted by R 1 2 ( B ) and expressed as
R 1 2 ( B ) = s t E ( B ) 1 δ ( s ) δ ( t ) .
Furtula and Ivan Gutman [3] discovered the forgotten index, also known as the F-index, which is defined as
F ( B ) = s t E ( B ) ( δ ( s ) 2 + δ ( t ) 2 ) .
Balaban [4,5] discovered another important index, the Balaban index, in 1982. For a graph B with ‘n’ vertices and ‘m’ edges, the formula is
J ( B ) = m m n + 2 s t E ( B ) 1 δ ( s ) × δ ( t ) .
Ranjini et al. [6] presented three types of reclassified Zagreb indices, which are defined as follows
R E Z G 1 ( B ) = s t E ( B ) δ ( s ) × δ ( t ) δ ( s ) + δ ( t ) .
R E Z G 2 ( B ) = s t E ( B ) δ ( s ) + δ ( t ) δ ( s ) × δ ( t ) .
R E Z G 3 ( B ) = s t E ( B ) ( δ ( s ) × δ ( t ) ) ( δ ( s ) + δ ( t ) ) .
Only A B C 4 and G A 5 indices can be computed if we can determine the edge partition of these connectivity chemical networks consisting of the sum of the degree of the ending vertices of each edge in all of these graphs. S s = v N B ( s ) d e g ( t ) where N G ( s ) = { t V ( B ) s t E ( B ) } .
Ghorbani et al. [7] introduced the A B C 4 index, which is described as
A B C 4 ( B ) = s t E ( B ) S s + S t 2 S s . S t .
Graovac et al. [8] introduced the fifth version of the GA index, which is as follows
G A 5 ( B ) = s t E ( B ) 2 S s S t S s + S t .

3. Main Results

We compute the exact results for all of the above descriptors in this paper, such as G A 5 . We suggest [9,10,11,12,13,14,15,16,17,18] for these results on various degree-based topological descriptors for a variety of graphs, and see [19,20] for basic notations and definitions.

3.1. Results for Benzenoid Planar Octahedron Network

We compute the F, J, R e Z G 1 , R e Z G 2 , R e Z G 3 , A B C 4 , and G A 5 for indices for the benzenoid planar octahedron network denoted by B 1 ( n ) in this section.
Theorem 1.
Consider the benzenoid planar octahedron network B P O H ( n ) ; its forgotten index is equal to
F ( B P O H ( n ) ) = 5580 n 2 1152 n .
Proof. 
Let B 1 ( n ) be the benzenoid planar octahedron network B P O H ( n ) , as shown in Figure 1, where n 2 and B 1 ( n ) has 45 n 2 3 n vertices, and the edge set of B 1 ( n ) is divided into five partitions depending on the degrees of end vertices.
We can obtain the following result by using Table 1 edge partition, and using Equation (2), we have
F ( B 1 ( n ) ) = 18 | E 1 ( B 1 ( n ) ) | + 25 | E 2 ( B 1 ( n ) ) | + 73 | E 3 ( B 1 ( n ) ) | + 80 | E 4 ( B 1 ( n ) ) | + 128 | E 5 ( B 1 ( n ) ) | ,
We obtain the following result after calculating it
F ( B 1 ( n ) ) = 5580 n 2 1152 n .
In the following theorem, we compute Balaban index of benzenoid planar octahedron network B P O H ( n ) .
Theorem 2.
For the benzenoid planar octahedron network B 1 ( n ) , the Balaban index is equal to
J ( B 1 ( n ) ) = 45 n 3 ( 6 + 6 2 + 8 3 4 6 + 3 ( 19 + 4 6 ) ) 90 n 2 + 6 n + 4 .
Proof. 
Let B 2 ( n ) represent the benzenoid planar octahedron network. The outcomes can be obtained from Table 1 using the edge partition, and using Equation (3), we have
J ( B 1 ( n ) ) = ( 90 n 2 45 n 2 + 3 n + 2 ) ( 1 3 | E 1 ( B 1 ( n ) ) | + 1 2 3 | E 2 ( B 1 ( n ) ) | + 1 2 6 | E 3 ( B 1 ( n ) ) | + 1 4 2 | E 4 ( B 1 ( n ) ) | + 1 8 | E 5 ( B 1 ( n ) ) | ) ,
We obtain the following result by using, after calculating it,
J ( B 1 ( n ) ) = 45 n 3 ( 6 + 6 2 + 8 3 4 6 + 3 ( 19 + 4 6 ) ) 90 n 2 + 6 n + 4 .
Theorem 3.
Let B 1 ( n ) be the benzenoid planar octahedron network n 2 . Then, we have
R e Z G 1 ( B 1 ( n ) ) = 2250 11 n 2 1664 77 ; R e Z G 2 ( B 1 ( n ) ) = 45 n 2 + 3 n ; R e Z G 3 ( B 1 ( n ) ) = 29880 n 2 9840 n .
Proof. 
Let B 1 ( n ) represent the benzenoid planar octahedron network. The outcomes can be obtained from Table 1 using the edge partition, and using Equation (4), we have
R e Z G 1 ( B 1 ( n ) ) = 3 2 | E 1 ( B 1 ( n ) ) | + 12 7 | E 2 ( B 1 ( n ) ) | + 24 11 | E 3 ( B 1 ( n ) ) | + 8 3 | E 4 ( B 1 ( n ) ) | + 4 | E 5 ( B 1 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 1 ( B 1 ( n ) ) = 2250 11 n 2 1664 77 .
The R e Z G 2 can be calculated by using (5) as follows
R e Z G 2 ( B 1 ( n ) ) = 2 3 | E 1 ( B 1 ( n ) ) | + 7 12 | E 2 ( B 1 ( n ) ) | + 11 24 | E 3 ( B 1 ( n ) ) | + 3 8 | E 4 ( B 1 ( n ) ) | + 1 4 | E 5 ( B 1 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 3 ( B 1 ( n ) ) = 45 n 2 + 3 n .
The R e Z G 3 index can be calculated from (6) as follows
R e Z G 3 ( B 1 ( n ) ) = 54 | E 1 ( B 1 ( n ) ) | + 84 | E 2 ( B 1 ( n ) ) | + 264 | E 3 ( B 1 ( n ) ) | + 384 | E 4 ( B 1 ( n ) ) | + 1024 | E 5 ( B 1 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 3 ( B 1 ( n ) ) = 29880 n 2 9840 n .
Now, we find A B C 4 and G A 5 indices of benzenoid planar octahedron network B P O H ( n ) .
Theorem 4.
Let B 1 ( n ) be the benzenoid planar octahedron network. Then:
  • A B C 4 ( B 1 ( n ) ) = 81 43 55 n 3 + ( 36 11 + 18 26 7 162 43 55 ) n 2 + ( 6 3 11 + 6 6 11 + 6 22 35 + 6 41 35 60 11 3 78 10 9 26 7 + 81 43 55 ) n + ( 6 3 11 + 4 7 11 6 41 55 + 8 6 7 + 37 5 + 24 11 9 78 20 ) ;
  • G A 5 ( B 1 ( n ) ) = 108 n 3 + ( 72 154 29 180 ) n 2 + ( 102 + 2 35 + 3 55 + 16 110 7 120 154 29 ) n + ( 18 + 72 10 19 + 144 14 25 + 72 22 29 3 55 2 16 110 7 + 48 154 29 ) .
Proof. 
The A B C 4 ( B 1 ( n ) ) can be calculated by using (7) as follows
A B C 4 ( B 1 ( n ) ) = 3 2 10 | E 1 ( B 1 ( n ) ) | + 770 70 | E 2 ( B 1 ( n ) ) | + 26 14 | E 3 ( B 1 ( n ) ) | + 42 21 | E 4 ( B 1 ( n ) ) | + 455 70 | E 5 ( B 1 ( n ) ) | + 1 11 | E 6 ( B 1 ( n ) ) | + 66 22 | E 7 ( B 1 ( n ) ) | 77 33 | E 8 ( B 1 ( n ) ) | + 33 22 | E 9 ( B 1 ( n ) ) | + 185 60 | E 10 ( B 1 ( n ) ) | + 78 40 | E 11 ( B 1 ( n ) ) | + 2250 220 | E 12 ( B 1 ( n ) ) | + 86 44 | E 13 ( B 1 ( n ) ) | ,
We obtain the following result by using Table 2
A B C 4 ( B 1 ( n ) ) = 81 43 55 n 3 + ( 36 11 + 18 26 7 162 43 55 ) n 2 + ( 6 3 11 + 6 6 11 + 6 22 35 + 6 41 35 60 11 3 78 10 9 26 7 + 81 43 55 ) n + ( 6 3 11 + 4 7 11 6 41 55 + 8 6 7 + 37 5 + 24 11 9 78 20 ) .
The index G A 5 can be determined from (7) as follows
G A 5 ( B 1 ( n ) ) = | E 1 ( B 1 ( n ) ) | + 35 6 | E 2 ( B 1 ( n ) ) | + | E 3 ( B 1 ( n ) ) | + 6 14 25 | E 4 ( B 1 ( n ) ) | + 4 35 27 | E 5 ( B 1 ( n ) ) | + 2 154 29 | E 6 ( B 1 ( n ) ) | + 55 8 | E 7 ( B 1 ( n ) ) | + 6 22 29 | E 8 ( B 1 ( n ) ) | + 4 55 31 | E 9 ( B 1 ( n ) ) | + 6 10 19 | E 10 ( B 1 ( n ) ) | + | E 11 ( B 1 ( n ) ) | + 2 110 21 | E 12 ( B 1 ( n ) ) | + | E 13 ( B 1 ( n ) ) | ,
We obtain the following result by using Table 2
G A 5 ( B 1 ( n ) ) = 108 n 3 + ( 72 154 29 180 ) n 2 + ( 102 + 2 35 + 3 55 + 16 110 7 120 154 29 ) n + ( 18 + 72 10 19 + 144 14 25 + 72 22 29 3 55 2 16 110 7 + 48 154 29 ) .

3.2. Results for Benzenoid-Dominating Planar Octahedron Network

We compute the F, J, R e Z G 1 , R e Z G 2 , R e Z G 3 , A B C 4 , and G A 5 for indices for the benzenoid-dominating planar octahedron network denoted by B 2 ( n ) in this section.
Theorem 5.
Consider the benzenoid-dominating planar octahedron network B D P O H ( n ) ; its forgotten index is equal to:
F ( B D P O H ( n ) ) = 16740 n 2 19044 n + 6732 .
Proof. 
Let B 2 ( n ) be the benzenoid-dominating planar octahedron network B D P O H ( n ) , as shown in Figure 2, where n 2 and B 2 ( n ) has 27 n 2 33 n + 12 vertices, and the edge set of B 2 ( n ) is divided into five partitions depending on the degrees of end vertices.
We can obtain the following result by using Table 3 edge partition, and using Equation (2), we have
F 1 ( B 2 ( n ) ) = 18 | E 1 ( B 2 ( n ) ) | + 25 | E 2 ( B 2 ( n ) ) | + 73 | E 3 ( B 2 ( n ) ) | + 80 | E 4 ( B 2 ( n ) ) | + 128 | E 5 ( B 2 ( n ) ) | ,
We obtain the following result after calculating it
F ( B 2 ( n ) ) = 16740 n 2 19044 n + 6732 .
Table 3. Degree-Based Edge Partition for B D P O H ( n ) .
Table 3. Degree-Based Edge Partition for B D P O H ( n ) .
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 3 , 3 ) 108 n 2 132 n + 48 ( 4 , 8 ) 24 n 12
( 3 , 4 ) 24 n 12 ( 8 , 8 ) 54 n 2 162 n + 84
( 3 , 8 ) 108 n 2 132 n + 48
In the following theorem, we compute Balaban index of benzenoid-dominating planar octahedron network B D P O H ( n ) .
Theorem 6.
For the benzenoid-dominating planar octahedron network B 2 ( n ) , the Balaban index is equal to:
J ( B 2 ( n ) ) = 1 4 ( 18 2 ( 2 n 1 ) ( 45 n 2 43 n + 14 ) 135 n 2 141 n + 50 + 4 6 ( 9 n 2 11 n + 4 ) + 3 ( 9 n 2 13 n + 5 ) + 48 ( 3 n 2 3 n + 1 ) + 8 3 ( 1 + 2 n ) ) .
Proof. 
Let B 2 ( n ) represent the benzenoid-dominating planar octahedron network. The outcomes can be obtained from Table 3 using the edge partition, and using Equation (3), we have
J ( B 2 ( n ) ) = ( 90 n 2 45 n 2 + 3 n + 2 ) ( 1 3 | E 1 ( B 2 ( n ) ) | + 1 2 3 | E 2 ( B 2 ( n ) ) | + 1 2 6 | E 3 ( B 2 ( n ) ) | + 1 4 2 | E 4 ( B 2 ( n ) ) | + 1 8 | E 5 ( B 2 ( n ) ) | ) ,
We obtain following result by performing calculation
J ( B 2 ( n ) ) = 1 4 ( 18 2 ( 2 n 1 ) ( 45 n 2 43 n + 14 ) 135 n 2 141 n + 50 + 4 6 ( 9 n 2 11 n + 4 ) + 3 ( 9 n 2 13 n + 5 ) + 48 ( 3 n 2 3 n + 1 ) + 8 3 ( 1 + 2 n ) ) .
Theorem 7.
Let B 2 ( n ) be the benzenoid-dominating planar octahedron network n 2 . Then, we have
R e Z G 1 ( B 2 ( n ) ) = 6750 11 n 2 4598 7 n + 17414 77 ; R e Z G 2 ( B 2 ( n ) ) = 135 n 2 129 n + 42 ; R e Z G 3 ( B 2 ( n ) ) = 89640 n 2 110160 n + 40140 .
Proof. 
Let B 2 ( n ) represent the benzenoid-dominating planar octahedron network. The outcomes can be obtained from Table 3, and using the edge partition as follows and using Equation (4), we have
R e Z G 1 ( B 2 ( n ) ) = 3 2 | E 1 ( B 2 ( n ) ) | + 12 7 | E 2 ( B 2 ( n ) ) | + 24 11 | E 3 ( B 2 ( n ) ) | + 8 3 | E 4 ( B 2 ( n ) ) | + 4 | E 5 ( B 2 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 1 ( B 2 ( n ) ) = 6750 11 n 2 4598 7 n + 17414 77 .
The R e Z G 2 can be calculated by using (5) as follows
R e Z G 2 ( B 2 ( n ) ) = 2 3 | E 1 ( B 2 ( n ) ) | + 7 12 | E 2 ( B 2 ( n ) ) | + 11 24 | E 3 ( B 2 ( n ) ) | + 3 8 | E 4 ( B 2 ( n ) ) | + 1 4 | E 5 ( B 2 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 2 ( B 2 ( n ) ) = 135 n 2 129 n + 42 .
The R e Z G 3 index can be calculated from (6) as follows
R e Z G 3 ( B 2 ( n ) ) = 54 | E 1 ( B 2 ( n ) ) | + 84 | E 2 ( B 2 ( n ) ) | + 264 | E 3 ( B 2 ( n ) ) | + 384 | E 4 ( B 2 ( n ) ) | + 1024 | E 5 ( B 2 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 3 ( B 2 ( n ) ) = 89640 n 2 110160 n + 40140 .
Now, we find A B C 4 and G A 5 indices of benzenoid-dominating planar octahedron network B D P O H ( n ) .
Theorem 8.
Let B 2 ( n ) be the benzenoid-dominating planar octahedron network. Then:
  • A B C 4 ( B 2 ( n ) ) = 486 43 55 n 3 + ( 114 11 + 51 26 7 1296 43 11 ) n 2 + ( 6 2 3 + 12 13 35 + 12 6 11 + 12 22 35 + 4 7 11 + 6 41 55 + 8 6 7 + 37 5 210 11 57 26 7 + 567 43 55 ) + ( 6 3 11 6 6 11 6 22 35 6 41 55 37 5 + 84 11 + 70 6 + 9 26 7 27 43 11 ;
  • G A 5 ( B 2 ( n ) ) = 648 n 3 + ( 1590 + 288 154 29 ) n 2 + ( 1290 + 72 10 19 + 144 14 25 + 72 22 29 + 68 35 9 + 141 55 31 + 16 110 7 420 154 29 ) n + ( 336 72 10 19 2 35 189 55 62 16 110 7 + 168 154 29 .
Proof. 
Using the edge partition, we have
A B C 4 ( B 2 ( n ) ) = 3 2 10 | E 1 ( B 2 ( n ) ) | + 770 70 | E 2 ( B 2 ( n ) ) | + 26 14 | E 3 ( B 2 ( n ) ) | + 42 21 | E 4 ( B 2 ( n ) ) | + 455 70 | E 5 ( B 2 ( n ) ) | + 1 11 | E 6 ( B 2 ( n ) ) | + 66 22 | E 7 ( B 2 ( n ) ) | + 77 33 | E 8 ( B 2 ( n ) ) | + 33 22 | E 9 ( B 2 ( n ) ) | + 185 60 | E 10 ( B 2 ( n ) ) | + 78 40 | E 11 ( B 2 ( n ) ) | + 2250 220 | E 12 ( B 2 ( n ) ) | + 86 44 | E 13 ( B 2 ( n ) ) | ,
We obtain the following result by using Table 4
A B C 4 ( B 2 ( n ) ) = 486 43 55 n 3 + ( 114 11 + 51 26 7 1296 43 11 ) n 2 + ( 6 3 11 + 12 13 35 + 12 6 11 + 12 22 35 + 4 7 11 + 6 41 55 + 8 6 7 + 37 5 210 11 57 26 7 + 567 43 55 ) n + ( 6 3 11 6 6 11 6 22 35 6 41 55 37 5 + 84 11 + 70 6 + 9 26 7 27 43 11 ) .
The index G A 5 can be determined from (8) as follow
G A 5 ( B 2 ( n ) ) = | E 1 ( B 2 ( n ) ) | + 35 6 | E 2 ( B 2 ( n ) ) | + | E 3 ( B 2 ( n ) ) | + 6 14 25 | E 4 ( B 2 ( n ) ) | + 4 35 27 | E 5 ( B 2 ( n ) ) | + 2 154 29 | E 6 ( B 2 ( n ) ) | + 55 8 | E 7 ( B 2 ( n ) ) | + 6 22 29 | E 8 ( B 2 ( n ) ) | + 4 55 31 | E 9 ( B 2 ( n ) ) | + 6 10 19 | E 10 ( B 2 ( n ) ) | + | E 11 ( B 2 ( n ) ) | + 2 110 21 | E 12 ( B 2 ( n ) ) | + | E 13 ( B 2 ( n ) ) | ,
We obtain the following result using Table 4
G A 5 ( B 2 ( n ) ) = 648 n 3 + ( 1590 + 288 154 29 ) n 2 + ( 1290 + 72 10 19 + 144 14 25 + 72 22 29 + 68 35 9 + 141 55 31 + 16 110 7 420 154 29 ) n + ( 336 72 10 19 2 35 189 55 62 16 110 7 + 168 154 29 )

3.3. Results for Benzenoid Hex Planar Octahedron Network

In this section, we compute certain degree-based topological indices of benzenoid hex planar octahedron network denoted by B 3 ( n ) and compute the F, J, R e Z G 1 , R e Z G 2 , R e Z G 3 , A B C 4 , and G A 5 indices for benzenoid hex planar octahedron network in this section.
Theorem 9.
Consider the benzenoid hex planar octahedron network B H P O H ( n ) ; its forgotten index is equal to:
F ( B H P O H ( n ) ) = 5580 n 2 + 4008 n + 48 .
Proof. 
Let B 3 ( n ) be the benzenoid hex planar octahedron network B H P O H ( n ) as shown in Figure 3, where n 2 and B 3 ( n ) has 45 n 2 + 51 n + 6 vertices and the edge set of B 3 ( n ) is divided into seven partitions based on the degrees of end vertices.
We can obtain the following result by using Table 5 edge partition.
F 1 ( B 3 ( n ) ) = 29 | E 1 ( B 3 ( n ) ) | + 18 | E 2 ( B 3 ( n ) ) | + 34 | E 3 ( B 3 ( n ) ) | + 128 | E 4 ( B 3 ( n ) ) | + 73 | E 5 ( B 3 ( n ) ) | + 50 | E 6 ( B 3 ( n ) ) | + 89 | E 7 ( B 3 ( n ) ) | ,
We obtain the following result after calculating it
F ( B 3 ( n ) ) = 5580 n 2 + 4008 n + 48 .
Figure 3. Benzenoid hex planar octahedron network B H P O H ( 2 ) .
Figure 3. Benzenoid hex planar octahedron network B H P O H ( 2 ) .
Molecules 27 06366 g003
Table 5. Degree-based edge partition for B H P O H ( n ) .
Table 5. Degree-based edge partition for B H P O H ( n ) .
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 2 , 5 ) 12 ( 5 , 5 ) 12 n 6
( 3 , 3 ) 36 n 2 36 n ( 5 , 8 ) 12 n
( 3 , 5 ) 24 n ( 8 , 8 ) 18 n 2
( 3 , 8 ) 36 n 2 + 12 n
In the following theorem, we compute Balaban index of benzenoid hex planar octahedron network B H P O H ( n ) .
Theorem 10.
For the benzenoid hex planar octahedron network B 3 ( n ) , the Balaban index is equal to:
J ( B 3 ( n ) ) = 1 10 ( 45 n 2 + 45 n + 2 ) 3 ( 15 n 2 + 16 n + 1 ) ( 24 ( 1 + 10 ) + 4 ( 72 + 5 6 + 3 10 + 8 15 ) n + 15 ( 19 + 4 6 ) n 2 ) .
Proof. 
Let B 3 ( n ) represent the benzenoid hex planar octahedron network. The outcomes can be obtained from Table 5 using the edge partition, and using Equation (3), we have
J ( B 3 ( n ) ) = 90 n 2 + 96 n + 6 45 n 2 + 45 n + 2 ( 1 10 | E 1 ( B 3 ( n ) ) | + 1 3 | E 2 ( B 3 ( n ) ) | + 1 15 | E 3 ( B 3 ( n ) ) | + 1 2 6 | E 4 ( B 3 ( n ) ) | + 1 5 | E 5 ( B 3 ( n ) ) | + 1 2 10 | E 6 ( B 3 ( n ) ) | + 1 8 | E 7 ( B 3 ( n ) ) | ) ,
We obtain the following result after calculating it
J ( B 3 ( n ) ) = 1 10 ( 45 n 2 + 45 n + 2 ) 3 ( 15 n 2 + 16 n + 1 ) ( 24 ( 1 + 10 ) + 4 ( 72 + 5 6 + 3 10 + 8 15 ) n + 15 ( 19 + 4 6 ) n 2 ) .
Theorem 11.
Let B 3 ( n ) be the benzenoid hex planar octahedron network n 2 . Then, we have
R e Z G 1 ( B 3 ( n ) ) = 2250 11 n 2 + 27471 143 n + 15 7 ; R e Z G 2 ( B 3 ( n ) ) = 45 n 2 + 51 n + 6 ; R e Z G 3 ( B 3 ( n ) ) = 29880 n 2 + 17232 660 .
Proof. 
Let B 3 ( n ) represent the benzenoid hex planar octahedron network. The outcomes can be obtained from Table 5 using the edge partition, and using Equation (4), we have
R e Z G 1 ( B 3 ( n ) ) = 10 7 | E 1 ( B 3 ( n ) ) | + 3 2 | E 2 ( B 3 ( n ) ) | + 15 8 | E 3 ( B 3 ( n ) ) | + 24 11 | E 4 ( B 3 ( n ) ) | + 5 2 | E 5 ( B 3 ( n ) ) | + 40 13 | E 6 ( B 3 ( n ) ) | + 4 | E 7 ( B 3 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 1 ( B 3 ( n ) ) = 2250 11 n 2 + 27471 143 n + 15 7 .
The R e Z G 2 can be calculated by using (5) as follows
R e Z G 2 ( B 3 ( n ) ) = 7 10 | E 1 ( B 3 ( n ) ) | + 2 3 | E 2 ( B 3 ( n ) ) | + 8 15 | E 3 ( B 3 ( n ) ) | + 11 24 | E 4 ( B 3 ( n ) ) | + 2 5 | E 5 ( B 3 ( n ) ) | + 13 40 | E 6 ( B 3 ( n ) ) | + 1 4 | E 7 ( B 3 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 2 ( B 3 ( n ) ) = 45 n 2 + 51 n + 6 .
The R e Z G 3 index can be calculated from (6) as follows
R e Z G 3 ( B 3 ( n ) ) = 70 | E 1 ( B 3 ( n ) ) | + 54 | E 2 ( B 3 ( n ) ) | + 120 | E 3 ( B 3 ( n ) ) | + 1024 | E 4 ( B 3 ( n ) ) | + 264 | E 5 ( B 3 ( n ) ) | + 250 | E 6 ( B 3 ( n ) ) | + 1024 | E 7 ( B 3 ( n ) ) | ,
We obtain the following result after calculating it
R e Z G 3 ( B 3 ( n ) ) = 29880 n 2 + 17232 660 .
Now, we find A B C 4 and G A 5 indices of benzenoid hex planar octahedron network B H P O H ( n ) .
Theorem 12.
Let B 3 ( n ) be the benzenoid hex planar octahedron network. Then:
  • A B C 4 ( B 3 ( n ) ) = 27 11 430 19 n 3 + ( 36 11 45 8170 209 + 18 26 7 ) + ( 60 10 209 + 6 46 77 + 6 2 + 36 5 11 12 11 + 18 8170 209 + 3 26 7 ) n + ( 24 10 77 + 6 2 7 6 2 + 2 174 35 3 46 4 + 86 7 ) ;
  • G A 5 ( B 3 ( n ) ) = 18 11 3 19 n 3 + ( 36 7 + 18 2 77 30 57 209 ) + ( 395 77 + 6 2 209 + 12 57 209 + 4 6 11 + 24 133 ) n + ( 3 2 + 16 3 77 + 4 6 133 + 4 6 35 + 2 2 7 4 6 11 ) .
Proof. 
Using the edge partition, we have
A B C 4 ( B 3 ( n ) ) = 6090 210 | E 1 ( B 3 ( n ) ) | + 2 5 11 | E 2 ( B 3 ( n ) ) | + 3542 154 | E 3 ( B 3 ( n ) ) | + 26 14 | E 4 ( B 3 ( n ) ) | + 5 266 266 | E 5 ( B 3 ( n ) ) | + 1 11 | E 6 ( B 3 ( n ) ) | + 770 77 | E 7 ( B 3 ( n ) ) | + 602 84 | E 8 ( B 3 ( n ) ) | + 1 14 | E 9 ( B 3 ( n ) ) | + 2 4 | E 10 ( B 3 ( n ) ) | + 46 24 | E 11 ( B 3 ( n ) ) | + 95 38 | E 12 ( B 3 ( n ) ) | + 2090 209 | E 13 ( B 3 ( n ) ) | + 86 44 | E 14 ( B 3 ( n ) ) | ,
We obtain the following result by using Table 6
A B C 4 ( B 3 ( n ) ) = 27 11 430 19 n 3 + 36 11 45 8170 209 + 18 26 7 + ( 60 10 209 + 6 46 77 + 6 2 + 36 5 11 12 11 + 18 8170 209 + 3 26 7 ) n + 24 10 77 + 6 2 7 6 2 + 2 174 35 3 46 4 + 86 7 .
The index G A 5 can be determined from (8) as follows
G A 5 ( B 3 ( n ) ) = 2 210 21 | E 1 ( B 3 ( n ) ) | + | E 2 ( B 3 ( n ) ) | + 2 154 25 | E 3 ( B 3 ( n ) ) | + | E 4 ( B 3 ( n ) ) | + 133 13 | E 5 ( B 3 ( n ) ) | + 2 154 29 | E 6 ( B 3 ( n ) ) | + 231 16 | E 7 ( B 3 ( n ) ) | + 4 14 15 | E 8 ( B 3 ( n ) ) | + 4 55 31 | E 9 ( B 3 ( n ) ) | + 2 798 59 | E 10 ( B 3 ( n ) ) | + | E 11 ( B 3 ( n ) ) | + 4 57 31 | E 12 ( B 3 ( n ) ) | + 2 418 41 | E 13 ( B 3 ( n ) ) | + | E 14 ( B 3 ( n ) ) | ,
We obtain the following result using Table 6
G A 5 ( B 3 ( n ) ) = 18 11 3 19 n 3 + 36 7 + 18 2 77 30 57 209 n 2 + ( 395 77 + 6 2 209 + 12 57 209 + 4 6 11 + 24 133 ) n + ( 3 2 + 16 3 77 + 4 6 133 + 4 6 35 + 2 2 7 4 6 11 ) .

4. Comparison of Indices through Graphs

The comparison of the of A B C 4 index and G A 5 index for B 1 ( n ) , B 2 ( n ) , and B 3 ( n ) is conducted for different values of n. The comparison graphs are shown in Figure 4 and Figure 5.

5. Applications

Graph theory is fast becoming a popular topic in mathematics because of its numerous applications in fields as varied as biochemistry (genomics), electrical engineering (communications networks and coding theory), computer science (algorithms and computations), and operations research. These results are also very useful for chemists who are working on such graphs.

6. Conclusions

The study of topological descriptors can help us construct basic network topologies. The specific result for the forgotten index, Balaban index, reclassified Zagreb indices, A B C 4 index, and G A 5 index of the benzenoid networks of type are contained in this study. Benzenoid networks have been researched in respect to several graph-ideological factors due to their fascinating and complicated characteristics. These results could be useful for computer scientists and chemists who deal with benzenoid networks.

Author Contributions

Methodology, J.-B.L.; writing—original draft preparation, H.A.; software, Q.U.A.; supervision, P.A.; validation, S.A.K.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by Natural Science Fund of Education Department of Anhui Province under Grant KJ2020A0478.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ali, H.; Siddiqui, H.M.A.; Shafiq, M.K. On degree-based topological descriptors of oxide and silicate molecular structures. MAGNT Res. Rep. 2016, 4, 135–142. [Google Scholar]
  2. Randić, M. 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 squeeze using harmonic index. Int. J. Graph Theory 2013, 1, 116–121. [Google Scholar]
  7. Ghorbani, M.; Hosseinzadeh, M.A. Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun. 2010, 4, 1419–1422. [Google Scholar]
  8. Graovac, A.; Ghorbani, M.; Hosseinzadeh, M.A. Computing fifth geometric-arithmetic index for nanostar dendrimers. J. Math. Nanosci. 2011, 1, 33–42. [Google Scholar]
  9. Ali, H.; Binyamin, M.A.; Shafiq, M.K.; Gao, W. On the degree-based topological indices of some derived networks. Mathematics 2019, 7, 612. [Google Scholar] [CrossRef]
  10. Ali, H.; Sajjad, A. On further results of hex derived networks. Open J. Discret. Appl. Math. 2019, 2, 32–40. [Google Scholar] [CrossRef]
  11. Azari, M. Multiplicative-sum Zagreb index of splice, bridge, and bridge-cycle graphs. Bol. Soc. Paran. Mat. 2021, 39, 189–200. [Google Scholar] [CrossRef]
  12. Azari, M.; Iranmanesh, A.; Tehranian, A. Two topological indices of three chemical structures. MATCH Commun. Math. Comput. Chem. 2013, 69, 69–86. [Google Scholar]
  13. Falahati-Nezhad, F.; Azari, M. The inverse sum indeg index of some nanotubes. Studia Univ. Babes Bolyai Chem. 2016, 61, 63–70. [Google Scholar]
  14. Liu, J.B.; Bao, Y.; Zheng, W.T.; Hayat, S. Network coherence analysis on a family of nested weighted n-polygon networks. Fractals 2021, 29, 2150260. [Google Scholar] [CrossRef]
  15. Liu, J.B.; Wang, C.; Wang, S.; Wei, B. Zagreb indices and multiplicative Zagreb indices of eulerian graphs. Bull. Malays. Math. Sci. Soc. 2019, 42, 67–78. [Google Scholar] [CrossRef]
  16. Liu, J.B.; Zhao, J.; Cai, Z.Q. On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks. Phys. A Stat. Mech. Its Appl. 2020, 540, 123073. [Google Scholar] [CrossRef]
  17. Liu, J.B.; Zhao, J.; He, H.; Shao, Z. Valency-based topological descriptors and structural property of the generalized sierpiński networks. J. Stat. Phys. 2019, 177, 1131–1147. [Google Scholar] [CrossRef]
  18. Liu, J.B.; Zhang, T.; Wang, Y.; Lin, W. The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain. Discret. Appl. Math. 2022, 307, 22–31. [Google Scholar] [CrossRef]
  19. Nikolić, S.; Trinajstić, N. The Wiener index: Development and applications. Croat. Chem. Acta 1995, 68, 105–129. [Google Scholar]
  20. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Benzenoid planar octahedron network B P O H ( 2 ) .
Figure 1. Benzenoid planar octahedron network B P O H ( 2 ) .
Molecules 27 06366 g001
Figure 2. Benzenoid-dominating planar octahedron network B D P O H ( 2 ) .
Figure 2. Benzenoid-dominating planar octahedron network B D P O H ( 2 ) .
Molecules 27 06366 g002
Figure 4. Comparison of A B C 4 index for B 1 ( n ) , B 2 ( n ) , and B 3 ( n ) .
Figure 4. Comparison of A B C 4 index for B 1 ( n ) , B 2 ( n ) , and B 3 ( n ) .
Molecules 27 06366 g004
Figure 5. Comparison of G A 5 index for B 1 ( n ) , B 2 ( n ) , and B 3 ( n ) .
Figure 5. Comparison of G A 5 index for B 1 ( n ) , B 2 ( n ) , and B 3 ( n ) .
Molecules 27 06366 g005
Table 1. Degree-based edge partition for BPOH(n).
Table 1. Degree-based edge partition for BPOH(n).
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 3 , 3 ) 36 n 2 ( 4 , 8 ) 12 n
( 3 , 4 ) 12 n ( 8 , 8 ) 18 n 2 12 n
( 3 , 8 ) 36 n 2 12 n
Table 2. Edge partition based on sum of degrees for B P O H ( n ) .
Table 2. Edge partition based on sum of degrees for B P O H ( n ) .
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 10 , 10 ) 6 n ( 22 , 36 ) 12 n
( 10 , 14 ) 12 n ( 22 , 40 ) 12 ( n 1 )
( 14 , 14 ) 36 n 2 18 n ( 36 , 40 ) 12
( 14 , 36 ) 24 ( 40 , 40 ) 12 n 18
( 14 , 40 ) 48 ( n 1 ) ( 40 , 44 ) 12 ( n 1 )
( 14 , 44 ) 36 n 2 60 n + 24 ( 44 , 44 ) 18 n 2 36 n + 18
( 22 , 10 ) 12 n
Table 4. Edge partition based on sum of degrees for B D P O H ( n ) .
Table 4. Edge partition based on sum of degrees for B D P O H ( n ) .
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 10 , 10 ) 12 n 6 ( 22 , 36 ) 12 n
( 10 , 14 ) 24 n 12 ( 22 , 40 ) 12 ( n 1 )
( 14 , 14 ) 102 n 2 114 n + 18 ( 36 , 40 ) 12 ( n 1 )
( 14 , 36 ) 24 n ( 36 , 36 ) 6
( 14 , 40 ) 24 n ( 40 , 44 ) 24 ( n 1 )
( 14 , 44 ) 114 n 2 210 n + 48 ( 44 , 44 ) 54 n 2 114 n + 6
( 10 , 22 ) 24 n 12
Table 6. Edge partition based on sum of degrees for BHPOH(n).
Table 6. Edge partition based on sum of degrees for BHPOH(n).
( δ ( s ) , δ ( t ) ) Number of Edges ( δ ( s ) , δ ( t ) ) Number of Edges
( 10 , 21 ) 12 ( 21 , 24 ) 12
( 11 , 11 ) 18 n ( 21 , 38 ) 12 n
( 11 , 14 ) 12 n ( 24 , 11 ) 24 n 24
( 14 , 14 ) 36 n 2 + 6 n ( 24 , 24 ) 12 n 18
( 14 , 38 ) 24 n ( 24 , 38 ) 12 n 12
( 21 , 11 ) 24 n ( 44 , 44 ) 18 n 2 12 n
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Liu, J.-B.; Ali, H.; Ain, Q.U.; Ali, P.; Kirmani, S.A.K. On Topological Properties for Benzenoid Planar Octahedron Networks. Molecules 2022, 27, 6366. https://doi.org/10.3390/molecules27196366

AMA Style

Liu J-B, Ali H, Ain QU, Ali P, Kirmani SAK. On Topological Properties for Benzenoid Planar Octahedron Networks. Molecules. 2022; 27(19):6366. https://doi.org/10.3390/molecules27196366

Chicago/Turabian Style

Liu, Jia-Bao, Haidar Ali, Qurat Ul Ain, Parvez Ali, and Syed Ajaz K. Kirmani. 2022. "On Topological Properties for Benzenoid Planar Octahedron Networks" Molecules 27, no. 19: 6366. https://doi.org/10.3390/molecules27196366

Article Metrics

Back to TopTop