%0 Journal Article
%A Tavakoli, M.
%A Rahbarnia, F.
%A Ashrafi, A. R
%T Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
%J Iranian Journal of Mathematical Sciences and Informatics
%V 11
%N 1
%U http://ijmsi.ir/article-1-891-en.html
%R
%D 2016
%K Tricyclic graph, Tetracyclic graph, Eccentric connectivity index,
%X 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$.
%> http://ijmsi.ir/article-1-891-en.pdf
%P 137-143
%& 137
%!
%9 Research paper
%L A-10-1873-2
%+ University of Kashan
%G eng
%@ 1735-4463
%[ 2016