On Topological Properties for Benzenoid Planar Octahedron Networks

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.


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.

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 benzenoiddominating 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 BDPOH(n) and the benzenoid hex planar octahedron network BHPOH(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 . (1) Furtula and Ivan Gutman [3] discovered the forgotten index, also known as the F-index, which is defined as 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 . ( Ranjini et al. [6] presented three types of reclassified Zagreb indices, which are defined as follows Only ABC 4 and GA 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.
Ghorbani et al. [7] introduced the ABC 4 index, which is described as Graovac et al. [8] introduced the fifth version of the GA index, which is as follows
Proof. Let B 1 (n) be the benzenoid planar octahedron network BPOH(n), as shown in Figure 1, where n ≥ 2 and B 1 (n) has 45n 2 − 3n 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

(δ(s), δ(t))
Number of Edges (δ(s), δ(t)) Number of Edges We obtain the following result after calculating it In the following theorem, we compute Balaban index of benzenoid planar octahedron network BPOH(n).

Theorem 2.
For the benzenoid planar octahedron network B 1 (n), the Balaban index is equal to 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 We obtain the following result by using, after calculating it, Theorem 3. Let B 1 (n) be the benzenoid planar octahedron network n ≥ 2. Then, we have 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 We obtain the following result after calculating it The ReZG 2 can be calculated by using (5) as follows We obtain the following result after calculating it The ReZG 3 index can be calculated from (6) as follows We obtain the following result after calculating it Now, we find ABC 4 and GA 5 indices of benzenoid planar octahedron network BPOH(n). Theorem 4. Let B 1 (n) be the benzenoid planar octahedron network. Then: Proof. The ABC 4 (B 1 (n)) can be calculated by using (7) as follows We obtain the following result by using ). The index GA 5 can be determined from (7) as follows We obtain the following result by using ).

Results for Benzenoid-Dominating Planar Octahedron Network
We compute the F, J, ReZG 1 , ReZG 2 , ReZG 3 , ABC 4 , and GA 5 for indices for the benzenoid-dominating planar octahedron network denoted by B 2 (n) in this section.
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 We obtain the following result after calculating it The ReZG 2 can be calculated by using (5) as follows We obtain the following result after calculating it The ReZG 3 index can be calculated from (6) as follows We obtain the following result after calculating it =⇒ ReZG 3 (B 2 (n)) = 89640n 2 − 110160n + 40140. Now, we find ABC 4 and GA 5 indices of benzenoid-dominating planar octahedron network BDPOH(n). Theorem 8. Let B 2 (n) be the benzenoid-dominating planar octahedron network. Then: Proof. Using the edge partition, we have We obtain the following result by using ). Table 4. Edge partition based on sum of degrees for BDPOH(n). The index GA 5 can be determined from (8) as follow
Proof. Let B 3 (n) be the benzenoid hex planar octahedron network BHPOH(n) as shown in Figure 3, where n ≥ 2 and B 3 (n) has 45n 2 + 51n + 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.

Number of Edges
In the following theorem, we compute Balaban index of benzenoid hex planar octahedron network BHPOH(n).
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 We obtain the following result after calculating it =⇒ ReZG 1 (B 3 (n)) = 2250 11 n 2 + 27471 143 n + 15 7 .
The ReZG 2 can be calculated by using (5) as follows We obtain the following result by using Table 6 ABC 4 (B 3 (n)) =

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.

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, ABC 4 index, and GA 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.