Computing Eccentricity Based Topological Indices of Octagonal Grid O mn

Graph theory is successfully applied in developing a relationship between chemical structure and biological activity. The relationship of two graph invariants, the eccentric connectivity index and the eccentric Zagreb index are investigated with regard to anti-inflammatory activity, for a dataset consisting of 76 pyrazole carboxylic acid hydrazide analogs. The eccentricity εv of vertex v in a graph G is the distance between v and the vertex furthermost from v in a graph G. The distance between two vertices is the length of a shortest path between those vertices in a graph G. In this paper, we consider the Octagonal Grid Om n . We compute Connective Eccentric index Cξ(G) = ∑v∈V(G) dv/εv, Eccentric Connective Index ξ(G) = ∑v∈V(G) dvεv and eccentric Zagreb index of Octagonal Grid Om n , where dv represents the degree of the vertex v in G.


Introduction
Chemical graph theory is broadly utilized in the branch of scientific science and a few people say that chemical graph hypothesis and this hypothesis are connected with the commonsense utilizations of chart hypothesis for tackling the atomic issues.In Arithmetic, a model of synthetic framework depicts a substance chart of arrangements to clarify the relations between its fragments, for example, its particles, bonds between iotas, bunch of particles or atoms.
An associated basic graph G = (V(G) ∪ E(G)) is a chart comprising of n nodes and m joint line segment in which there is path between any of two distinct nodes.A system is simply an associated diagram comprising of no numerous edges and circles.The degree of a node q in G is the quantity of line segment which is occurrence to the node q and spoken to by d q .In a chart G, if there is no reiteration of vertices in (p − q) path then such sort of path is called (p − q) way.The quantity of line segment in (p − q) way is called its length." The separation d(w, y) from node w to node y is the length of a briefest (w − y) way in a diagram G where w, y ∈ G.In a associated diagram G, the eccentricity ε v of a node w is the separation amongst w and a node uttermost from w in G. Along these lines, ε w = max w∈V(G) d(w, y).Along these lines, the greatest capriciousness over all nodes of G is the width of G which is meant by D(G)." A diagram can be perceived by an alternate sort of a number, a polynomial, an arrangement of nodes or a grid.A topological list is a real number that is related with a chart which describes the topology of diagram and is investigated under diagram automorphism.From last two, topological lists, for example, Wiener record, Balaban's list [1][2][3], Hosoya file [4,5], Randi ć index [6] et cetera, have been considered widely; as of late, the exploration here has increased exponentially." There are some real classes of topological lists, for example, distance based topological lists, unusualness based topological files, degree based topological lists and tallying related polynomials and files of charts.In this article, we consider the eccentricity based indices.In [7], the creators presented the total eccentricity of the chart G, which is characterized as add up of eccentricities of all nodes of a given diagram G and meant by ζ(G).It is anything but difficult to see that for a k-standard Another very relevant and special eccentricity based topological index is Connective Eccentric index C ξ (G) that was proposed by Gupta et al. [8].The Connective Eccentric index is defined as:" where d v denotes degree of the vertex v and ε v denotes the eccentricity of the vertex v.The readers are referred to [9,10] for more information on Connective Eccentric index."A very important eccentricity based topological index of a graph G is the eccentric connectivity index ξ(G) which is defined as:" This topological index is used as a mathematical model to predict biological activities of diverse nature [11,12].For more mathematical properties of this index, we encourage the reader to refer to [13][14][15][16]." In 2012, Ghorbani and Hosseinzadeh [17] defined new versions of eccentric Zagreb indices, one of which is as follows:" The eccentric connectivity polynomial is the polynomial version of the eccentric-connectivity index which is introduced in [18] and ξ(G) is defined as:" In this article, we consider G to be a connected graph with vertex set V(G) and edge set E(G) , and compute the C ξ (G), ξ(G) and M * * 1 (G) of the Octagonal grid O m n ."

Methods
For the computation of our results, we utilized a strategy for combinatorial registering, a vertex partition strategy, an edge partition technique, graph hypothetical instruments, scientific systems, a degree-counting strategy, and a degrees of neighbors strategy."

The Octagonal Grid O m n
In [19,20] 1).In [21,22], they also called it the Octagonal grid.""For n, m ≥ 3, the Octagonal grid O m n is the grid with m rows and n columns of octagons.The symbols V(O m n ) and E(O m n ) denote the vertex set and the edge set of O m n , respectively."" In this paper, we consider O m n with n = m.and we compute Connective Eccentric index C ξ (G), Eccentric connectivity index ξ(G) and eccentric Zagreb indices of O m n .For this, we discuss two cases of n, when n ≡ 0(mod2) and when n ≡ 1(mod2)."Theorem 1.For every n ≥ 4 and n ≡ 0(mod2), consider the graph of G ∼ = O m n , with n = m.Then, the Connective Eccentric index of G is equal to:"" Proof.Let G be the graph of O m n .Note that graph of O m n is a symmetric about reflection and rotation at right angles.Thus, the eccentricities and from the symmetry at right angles we can obtain that the eccentricities By using the values in Table 1, we get Partition of vertices of the type u t s of O m n based on degree and eccentricity of each vertex when n ≡ 0(mod2).

Representative Degree
Eccentricity Range Frequency After an easy computation, we get "" Theorem 2. For every n ≥ 3 and n ≡ 1(mod2), consider the graph of G ∼ = O m n , with n = m.Then, the Connective Eccentric index of G is equal to Proof.Let G be the graph of O m n and n ≥ 3 is odd.As above noted, the graph of O m n is a symmetric about reflection and rotation at right angles.Thus, the eccentricities and from the symmetry at right angles we can obtain that the eccentricities By using the values in Table 2, we get After an easy computation, we get Theorem 3.For every n ≥ 4 and n ≡ 0(mod2), consider the graph of G ∼ = O m n , with n = m.Then, the Eccentric Connectivity index of G is equal to" Proof.By using the arguments in the proof of Theorem 1, the values in Table 1 and Equation ( 2), we get" 2{3n + s − 1}" After some easy calculations, we get Theorem 4. For every n ≥ 3 and n ≡ 1(mod2), consider the graph of G ∼ = O m n , with n = m.Then, the Eccentric Connectivity index of G is equal to" Proof.By using the arguments in the proof of Theorem 2, the values in Table 2 and Equation (2), we get" After some easy calculations, we get Theorem 5.For every n ≥ 4 and n ≡ 0(mod2), consider the graph of G ∼ = O m n , with n = m.Then, the eccentric Zagreb index of G is equal to" Proof.By using the arguments in the proof of Theorem 1, the values in Table 1 and the following equation, we get " After some easy calculations, we get (4s + t − n − 3)

Figure 1 .
Figure 1.The Octagonal grid O m n .
, Diudea et al. constructed a C 4 C 8 net as a trivalent decoration made by alternating squares C 4 and octagons C 8 in two different ways.One is by alternating squares C 4 and octagons C 8 in different ways denoted by C 4 C 8 (S) and the other is by alternating rhombus and octagons in different ways denoted by C 4 C 8 (R).We denote C 4 C 8 (R) by O m n (see Figure