If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
Kazemi,R . (2014). The Eccentric Connectivity Index of Bucket Recursive Trees. Iranian Journal of Mathematical Chemistry, 5(2), 77-83. doi: 10.22052/ijmc.2014.5671
MLA
Kazemi,R . "The Eccentric Connectivity Index of Bucket Recursive Trees", Iranian Journal of Mathematical Chemistry, 5, 2, 2014, 77-83. doi: 10.22052/ijmc.2014.5671
HARVARD
Kazemi R. (2014). 'The Eccentric Connectivity Index of Bucket Recursive Trees', Iranian Journal of Mathematical Chemistry, 5(2), pp. 77-83. doi: 10.22052/ijmc.2014.5671
CHICAGO
R Kazemi, "The Eccentric Connectivity Index of Bucket Recursive Trees," Iranian Journal of Mathematical Chemistry, 5 2 (2014): 77-83, doi: 10.22052/ijmc.2014.5671
VANCOUVER
Kazemi R. The Eccentric Connectivity Index of Bucket Recursive Trees. Iranian J. Math. Chem.. 2014;5(2):77-83. doi: 10.22052/ijmc.2014.5671
