فهرست نشریات علمی دسترسی آزاد ایران

The general degree-eccentricity index of a graph $G$ is defined by,$DEI_{a,b} (G) = \sum_{v \in V(G)} d_{G}^{a}(v) ecc_{G}^{b}(v)$ for $a, b \in \mathbb{R}$, where $V(G)$ is the vertex set of $G$, $ecc_{G}(v)$ is the eccentricity of a vertex $v$ and $d_{G}(v)$ is the degree of $v$ in $G$.In this paper, we generalize results on the general eccentric connectivity index fortrees.We present upper and lower bounds on the general degree-eccentricity index for trees of given order and diameter, and trees of given order and number of pendant vertices.The upper bounds hold for $a > 1$ and $b \in \mathbb{R}\setminus\{0\}$ andthe lower bounds holds for $0 < a < 1$ and $b \in \mathbb{R}\setminus\{0\}$.We include the case $a = 1$ and $b \in \{-1, 1\}$ in those theorems for which the proof of that case is not complicated.We present all the extremal graphs, which means that our bounds are best possible.