AU - Tavakoli, M.
AU - Rahbarnia, F.
AU - Ashrafi, A. R
TI - Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 11
VI - 1
IP - 1
4099 - http://ijmsi.ir/article-1-891-en.html
4100 - http://ijmsi.ir/article-1-891-en.pdf
SO - IJMSI 1
ABĀ - Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n$.
CP - IRAN
IN - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 87317-51167, I. R. Iran
LG - eng
PB - IJMSI
PG - 137
PT - Research paper
YR - 2016