Related papers: Eccentric Connectivity Index of Chemical Trees
The eccentric connectivity index $\xi^c$ is a novel distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as $\xi^c (G) = \sum_{v \in V (G)}…
The connective eccentricity index $\xi^{ce}=\sum^{}_{u\in V}\frac{d(u)}{\varepsilon(u)}$, where $\varepsilon(u)$ and $d(u)$ denote the eccentricity and the degree of the vertex $u$, respectively. In this paper, we first determine the…
The eccentric connectivity index, proposed by Sharma, Goswami and Madan, has been employed successfully for the development of numerous mathematical models for the prediction of biological activities of diverse nature. We now report…
The eccentric connectivity index of a graph $G$ is $\xi^c(G) = \sum_{v \in V(G)}\varepsilon(v)\deg(v)$, and the eccentric distance sum is $\xi^d(G) = \sum_{v \in V(G)}\varepsilon(v)D(v)$, where $\varepsilon(v)$ is the eccentricity of $v$,…
The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other…
The atom-bond connectivity (ABC) index is a degree-based molecular descriptor that found diverse chemical applications. Characterizing trees with minimum ABC-index remained an elusive open problem even after serious attempts and is…
Let $G=(V_G, E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^{d}(G) = \sum_{v\in V_G}\varepsilon_{G}(v)D_{G}(v)$, where $\varepsilon_G(v)$ is the eccentricity of the vertex $v$ and $D_G(v) =…
The Randic (connectivity) index is one of the most successful molecular descriptors in structure-property and structure-activity relationships studies. J. Gao found the sharp upper bound for the Randic index of apex trees. In this paper, we…
We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…
The {\em atom-bond connectivity (ABC) index} is one of the recently most investigated degree-based molecular structure descriptors, that have applications in chemistry. For a graph $G$, the ABC index is defined as $\sum_{uv\in…
The atom-bond connectivity (ABC) index is a degree-based molecular descriptor with diverse chemical applications. Recent work of Lin et al. [W. Lin, J. Chen, C. Ma, Y. Zhang, J. Chen, D. Zhang, and F. Jia, On trees with minimal ABC index…
The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we…
The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph $G$ is the maximum eccentricity of a vertex in $G$. The eccentric connectivity index of a connected…
The atom-bond connectivity (ABC) index is a degree-based molecular structure descriptor that can be used for modelling thermodynamic properties of organic chemical compounds. Motivated by its applicable potential, a series of investigations…
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph with experimentally gathered data regarding the compound's…
Let $G = (V, E)$ be a graph with non-empty set of vertices $V$ and set of edges $E$. The \emph{eccentric connectivity index} of the graph $G$ is defined as $$\displaystyle{\xi^C(G) = \sum_{u \in V} d_u \;ecc(u)}$$ where $d_u$ is the degree…
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom-bond connectivity index, $ABC_3$ index, of $G$ is defined as $ABC_3(G)=\sum\limits_{uv\in E(G)}\sqrt{\frac{e(u)+e(v)-2}{e(u)e(v)}}$, where…
In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…
The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine…
The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum…