Computing eccentricity based topological indices of octagonal grid \(O_n^m\) (Q1634491)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing eccentricity based topological indices of octagonal grid \(O_n^m\) |
scientific article |
Statements
Computing eccentricity based topological indices of octagonal grid \(O_n^m\) (English)
0 references
18 December 2018
0 references
Summary: 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 \(\varepsilon_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 \(O_n^m\). We compute connective eccentric index \(C^\xi(G) = \sum_{v \in V(G)} d_v / \varepsilon_v\), eccentric connective index \(\xi(G) = \sum_{v \in V(G)} d_v \varepsilon_v\) and eccentric Zagreb index of octagonal grid \(O_n^m\), where \(d_v\) represents the degree of the vertex \(v\) in \(G\).
0 references
eccentric connective index
0 references
connective eccentric index
0 references
eccentric Zagreb index
0 references
the octagonal grid \(O_n^m\)
0 references