Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants

A branch of graph theory that makes use of a molecular graph is called chemical graph theory. Chemical graph theory is used to depict a chemical molecule. A graph is connected if there is an edge between every pair of vertices. A topological index is a numerical value related to the chemical structure that claims to show a relationship between chemical structure and various physicochemical attributes, chemical reactivity, or, you could say, biological activity. In this article, we examined the topological properties of a planar octahedron network of m dimensions and computed the total eccentricity, average eccentricity, Zagreb eccentricity, geometric arithmetic eccentricity, and atom bond connectivity eccentricity indices, which are used to determine the distance between the vertices of a planar octahedron network.


Introduction and Preliminary Results
Topological indices are a helpful tool provided by graph theory. Computer analysis is a modern academic field that merges chemistry, mathematics, and computer technology [1][2][3][4][5]. Quantitative structure-activity (QSAR) and structure-property (QSPR) relationships are used to predict biological activities and the properties of chemical compounds. That is why they have piqued the curiosity of academics all around the world. Topological indices are gaining attraction in the world of communication chemistry because of their application in non-empirical, quantitative structure-property and quantitative structure-activity relationships. The topological descriptor Top(G) can also be defined in terms of isomorphisms: Top(G) = Top(H), for every isomorphic graph H to G. Weiner [6] first developed the notion of topological indices in 1947 while working in the lab on the boiling point of paraffin and referred to it as the path number. The path number was later renamed as the Wiener index.

Planar Octahedron POH(m) Network Drawing Algorithm
(Step 1:) Draw an m-dimensional silicate network [7].  In this article, we examined the planar octahedron network and evaluate the eccentricities of the m dimension. Let the graph G = G(V, E), where V and E are non-empty sets of vertices and edges to quantitatively represent molecular processes [8][9][10][11], which is beneficial for researching and using a diverse set of topological indices in theoretical chemistry. In chemical graph theory, there are several topological indices for graphs that are significant in the growth of chemical science. D(r, s) denotes the distance between r and s and is defined as the length of the shortest path in G if r, s ∈ V(G). The distance between vertex r and the graph's farthest vertex is defined as the eccentricity. In numerical terms, (r) = max s∈V(G) d(r, s). The total eccentricity index [12] is calculated as follows: where (c) is the vertex's eccentricity [13]. The graph's average eccentricity avec(G) [14] is whereι denotes the total number of vertices. Many researchers, including Ilic and Tang [15], have engaged in a few publications to show the average eccentricity index. The eccentricity geometric arithmetic index [16][17][18] is defined by The eccentricity version of the ABC index [19,20] is denoted as The Zagreb index [21][22][23] comes in the format of

Main Results
This section discusses the planar octahedron networks POH(m) for m dimensions.

Results for Planar Octahedron Network
Planar octahedron networks constructed from honeycomb structures [24,25] are critical in chemistry for researching materials. They have low density and good compression capabilities. These constructions are also used to study stress in a variety of aerospacerelated materials. In this section, we computed the eccentricity-based topological indices of a planar octahedron network. The following Table 1 shows the vertex partition of POH(m).

Sets
(c) Vertices Range Proof. Let G ∼ = POH(m), ∀ m ∈ N, and m ≥ 4 be the graph of a planar octahedron network. Through using vertices partitions from Table 1, we determined the total eccentricity index as follows: After simplification, we obtain Theorem 2. For POH(m), ∀ m ∈ N, and m ≥ 4, the average eccentricity index is equal to Proof. Let G ∼ = POH(m), ∀ m ∈ N, and m ≥ 4 containing 27m 2 + m vertices and 72m 2 edges. We computed the average eccentricity index as follows by using the vertices division from Table 1: After simplification, we obtain Theorem 3. For POH(m), ∀ m ∈ N, and m ≥ 4, the Zagreb eccentricity index is equal to Proof. Let G ∼ = POH(m), ∀ m ∈ N, and m ≥ 4 be the planar octahedron network. Using the vertex partitions from Table 1, we obtained the Zagreb eccentricity index as follows: After calculations, we have Theorem 4. For Planar octahedron network POH(m), ∀ m ∈ N, and m ≥ 2, the GA 4 index of POH(m) is equal to Proof. Let G ∼ = POH(m), ∀ m ∈ N, and m ≥ 2. The eccentricity using the GA 4 index is calculated as follows using the edge segmentation in Table 2: , After calculation, we obtain the CSGN function, which is used to find the half-plane in which a complex-valued expression or integer m residuals are found:
Proof. Let G ∼ = POH(m), ∀ m ∈ N, and m ≥ 2 be the graph planar octahedron network. Applying the edge partition in Table 2, we estimated the eccentricity ABC 5 as follows: ) , after calculation, we have ) .

Conclusions
In this article, we have calculated eccentricity-based topological indices, namely, total eccentricity, average eccentricity, and geometric arithmetic (GA 4 ), as well as atom bond connectivity (ABC 5 ) for the planar octahedron network POH(m). Octahedron networks have a variety of useful applications in pharmaceuticals, electronics, and networking. Individuals working in computer science and chemistry may find these findings beneficial from a chemical point of view. There are a number of unsolved problems in the evaluation of associated derived networks. Institutional Review Board Statement: Not applicable for studies not involving humans or animals.