Results 21 to 30 of about 4,605,701 (218)
Eccentric connectivity index and eccentric distance sum of some graph operations [PDF]
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 +1 more source
On the Adjacent Eccentric Distance Sum Index of Graphs. [PDF]
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 +2 more sources
Computing the Ediz eccentric connectivity index of discrete dynamic structures
From the earlier studies in physical and chemical sciences, it is found that the physico-chemical characteristics of chemical compounds are internally connected with their molecular structures. As a theoretical basis, it provides a new way of thinking by
Wu Hualong +4 more
doaj +3 more sources
Reverse eccentric connectivity index
Research on the topological indices based on eccentricity of vertices of a molecular graph has been intensively rising recently. Eccentric connectivity index, one of the best-known topological index in chemical graph theory, is belonging to this class of indices.
Ediz, Suleyman
openaire +2 more sources
Edge eccentric connectivity index of nanothorns
The edge eccentric connectivity index of a graph G is defined as xi(c)(e)(G) = Sigma(f is an element of E(G))deg(G)(f)epsilon c(G)(f), where deg(G)(f) is the degree of an edge f and ec(G)(f) is its eccentricity. In this paper, we investigate the edge eccentric connectivity index of a class of nanographs, namely, nanothorns and we present an explicit ...
Berberler, ZEYNEP NİHAN +1 more
core +3 more sources
Extremal trees of the eccentric connectivity index.
Chemical indices are introduced to correlate chemical compounds' physical properties with their structures. Among recently introduced such indices, the eccentric connectivity index of a graph G is defined as xi(C()G) = Sigma(v is an element of v(G)) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) is its eccentricity. The extremal values
Wang, Hua
openaire +2 more sources
On the Ediz eccentric connectivity index of a graph
If G is a connected graph with vertex set V, then the Ediz eccentric connectivity index of G, (E)xi(c)(G), is defined as ()Sigma(v is an element of V) S(v)/ec(v) where S(v) is the sum of degrees of all vertices adjacent to vertex v and ec(v) is its eccentricity.
Ediz, Süleyman
openaire +2 more sources
Augmented eccentric connectivity index [PDF]
We review basic mathematical properties of the augmented eccentric connectivity index. Explicit formulas are presented for several classes of graphs, in particular for some open and closed unbranched polymers and nanostructures. Asymptotic behavior is explored and compression ratios are computed for those polymers.
Doslic, Tomislav, Saheli, Mahboubeh
openaire +4 more sources
Amplified eccentric connectivity index of graphs [PDF]
A new distance based graphical index, coined as ampli ed eccentric connec- tivity index, has been established and the formulae to calculate the ampli ed eccentric connectivity index of some standard graphs, Dutch windmill graph and molecular graph of ...
Puneeth, S., Sujatha, H. N., Mathad, V.
core
On the Difference Between the Eccentric Connectivity Index and Eccentric Distance Sum of Graphs [PDF]
The eccentric connectivity index of a graph $G$ is $ξ^c(G) = \sum_{v \in V(G)}\varepsilon(v)°(v)$, and the eccentric distance sum is $ξ^d(G) = \sum_{v \in V(G)}\varepsilon(v)D(v)$, where $\varepsilon(v)$ is the eccentricity of $v$, and $D(v)$ the sum of distances between $v$ and the other vertices.
Yaser Alizadeh, Sandi Klavžar
openaire +3 more sources

