Results 21 to 30 of about 7,008 (268)
Distance eccentric connectivity index of graphs
, 2021 Summary: Let \(G = ( V, E )\) be a connected graph. The eccentric connectivity index of \(G\) is defined by \(\xi^C ( G ) = \sum_{u \in V (G)} \deg(u) e (u)\), where \(\deg(u)\) and \(e ( u )\) denote the degree and eccentricity of the vertex \(u\) in \(G\), respectively.
Cangül, İsmail Naci +4 more
openaire +2 more sources
Eccentricity-Based Topological Indices of a Cyclic Octahedron Structure
Mathematics, 2018 In this article, we study the chemical graph of a cyclic octahedron structure of dimension n and compute the eccentric connectivity polynomial, the eccentric connectivity index, the total eccentricity, the average eccentricity, the first Zagreb index ...
Manzoor Ahmed Zahid +3 more
doaj +1 more source
QSAR study for carcinogenicity in a large set of organic compounds [PDF]
, 2012 In our continuing efforts to find out acceptable Absorption, Distribution, Metabolization, Elimination and Toxicity (ADMET) properties of organic compounds, we establish linear QSAR models for the carcinogenic potential prediction of 1464 compounds taken
Castro, Eduardo Alberto +3 more
core +2 more sources
On the Adjacent Eccentric Distance Sum Index of Graphs. [PDF]
PLoS ONE, 2015 For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances ...
Hui Qu, Shujuan Cao
doaj +1 more source
The Eccentric-distance Sum of Some Graphs [PDF]
, 2017 Let $G = (V,E)$ be a simple connected graph. Theeccentric-distance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of the vertex $u$ in $G$ and $d(u,v)$ is thedistance ...
Mathad, V. (Veena), P, P. (Padmapriya)
core +2 more sources
The eccentric connectivity index of armchair polyhex nanotubes
Macedonian Journal of Chemistry and Chemical Engineering, 2010 The eccentric connectivity index ξ(G) of the graph G is defined as ξ(G) = Σu∈V(G) deg(u)ε(u) where deg(u) denotes the degree of vertex u and ε(u) is the largest distance between u and any other vertex v of G.
Mahboubeh Saheli, Ali Reza Ashrafi
doaj +1 more source
Eccentric connectivity index of chemical trees [PDF]
AIP Conference Proceedings, 2016 Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively, we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as the length of a shortest path joining them.
R. S. Haoer +4 more
openaire +1 more source
Eccentric connectivity index and eccentric distance sum of some graph operations [PDF]
Transactions on Combinatorics, 2013 Let $G=(V,E)$ be a connected graph. The eccentric connectivity index of $G$, $xi^{c}(G)$, is defined as $xi^{c}(G)=sum_{vin V(G)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. The eccentric distance sum of $G$
Buzohragul Eskender, Elkin Vumar
doaj
Two Degree Distance Based Topological Indices of Chemical Trees
IEEE Access, 2019 Let G = (VG, EG) be a simple and connected graph. The eccentric connectivity index of G is represented as ξc(G) = Σx∈VG degG(x)ecG(x), where degG(x) and ecG(x) represent the degree and the eccentricity of x, respectively.
Shehnaz Akhter
doaj +1 more source
Computing Eccentricity-Based Topological Indices of 2-Power Interconnection Networks
Journal of Chemistry, 2020 In a connected graph G with a vertex v, the eccentricity εv of v is the distance between v and a vertex farthest from v in the graph G. Among eccentricity-based topological indices, the eccentric connectivity index, the total eccentricity index, and the ...
Muhammad Imran +5 more
doaj +1 more source