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 into each of the oxide network.
- Step-3.
The resultant graph is also known as the benzenoid planar octahedron network. Connect alternating adjacent vertices to each opposite vertex. The benzenoid-dominating planar octahedron network is represented by , and the benzenoid hex planar octahedron network is represented by . The benzenoid-dominating planar octahedron network and the benzenoid hex planar octahedron network can be created using this approach (n).
B is considered as a simple connected graph in this article, and the degree of each vertex is denoted as .
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
and expressed as
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 and 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. where .
Ghorbani et al. [
7] introduced the
index, which is described as
Graovac et al. [
8] introduced the fifth version of the GA index, which is as follows
3. Main Results
We compute the exact results for all of the above descriptors in this paper, such as
. 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, , , , , and for indices for the benzenoid planar octahedron network denoted by in this section.
Theorem 1. Consider the benzenoid planar octahedron network ; its forgotten index is equal to Proof. Let
be the benzenoid planar octahedron network
, as shown in
Figure 1, where
and
has
vertices, and the edge set of
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
We obtain the following result after calculating it
□
In the following theorem, we compute Balaban index of benzenoid planar octahedron network .
Theorem 2. For the benzenoid planar octahedron network , the Balaban index is equal to Proof. Let
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 be the benzenoid planar octahedron network . Then, we have Proof. Let
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
can be calculated by using (
5) as follows
We obtain the following result after calculating it
The
index can be calculated from (
6) as follows
We obtain the following result after calculating it
□
Now, we find and indices of benzenoid planar octahedron network .
Theorem 4. Let be the benzenoid planar octahedron network. Then:
Proof. The
can be calculated by using (
7) as follows
We obtain the following result by using
Table 2The index
can be determined from (
7) as follows
We obtain the following result by using
Table 2□
3.2. Results for Benzenoid-Dominating Planar Octahedron Network
We compute the F, J, , , , , and for indices for the benzenoid-dominating planar octahedron network denoted by in this section.
Theorem 5. Consider the benzenoid-dominating planar octahedron network ; its forgotten index is equal to: Proof. Let
be the benzenoid-dominating planar octahedron network
, as shown in
Figure 2, where
and
has
vertices, and the edge set of
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
We obtain the following result after calculating it
□
Table 3.
Degree-Based Edge Partition for .
Table 3.
Degree-Based Edge Partition for .
| Number of Edges | | Number of Edges |
---|
| | | |
| | | |
| | | |
In the following theorem, we compute Balaban index of benzenoid-dominating planar octahedron network .
Theorem 6. For the benzenoid-dominating planar octahedron network , the Balaban index is equal to: Proof. Let
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
We obtain following result by performing calculation
□
Theorem 7. Let be the benzenoid-dominating planar octahedron network . Then, we have Proof. Let
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
can be calculated by using (
5) as follows
We obtain the following result after calculating it
The
index can be calculated from (
6) as follows
We obtain the following result after calculating it
□
Now, we find and indices of benzenoid-dominating planar octahedron network .
Theorem 8. Let be the benzenoid-dominating planar octahedron network. Then:
Proof. Using the edge partition, we have
We obtain the following result by using
Table 4The index
can be determined from (
8) as follow
We obtain the following result using
Table 4□
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 and compute the F, J, , , , , and indices for benzenoid hex planar octahedron network in this section.
Theorem 9. Consider the benzenoid hex planar octahedron network ; its forgotten index is equal to: Proof. Let
be the benzenoid hex planar octahedron network
as shown in
Figure 3, where
and
has
vertices and the edge set of
is divided into seven partitions based on the degrees of end vertices.
We can obtain the following result by using
Table 5 edge partition.
We obtain the following result after calculating it
□
Figure 3.
Benzenoid hex planar octahedron network .
Figure 3.
Benzenoid hex planar octahedron network .
Table 5.
Degree-based edge partition for .
Table 5.
Degree-based edge partition for .
| Number of Edges | | Number of Edges |
---|
| 12 | | |
| | | |
| | | |
| | | |
In the following theorem, we compute Balaban index of benzenoid hex planar octahedron network .
Theorem 10. For the benzenoid hex planar octahedron network , the Balaban index is equal to: Proof. Let
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
We obtain the following result after calculating it
□
Theorem 11. Let be the benzenoid hex planar octahedron network . Then, we have Proof. Let
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
The
can be calculated by using (
5) as follows
We obtain the following result after calculating it
The
index can be calculated from (
6) as follows
We obtain the following result after calculating it
□
Now, we find and indices of benzenoid hex planar octahedron network .
Theorem 12. Let be the benzenoid hex planar octahedron network. Then:
Proof. Using the edge partition, we have
We obtain the following result by using
Table 6The index
can be determined from (
8) as follows
We obtain the following result using
Table 6□
4. Comparison of Indices through Graphs
The comparison of the of
index and
index for
,
, and
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, index, and 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.