@ARTICLE{Ashrafi,
author = {Tavakoli, M. and Rahbarnia, F. and Ashrafi, A. R and },
title = {Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity},
volume = {11},
number = {1},
abstract ={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$. },
URL = {http://ijmsi.ir/article-1-891-en.html},
eprint = {http://ijmsi.ir/article-1-891-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {},
year = {2016}
}