RT - Journal Article T1 - Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity JF - IJMSI YR - 2016 JO - IJMSI VO - 11 IS - 1 UR - http://ijmsi.ir/article-1-891-en.html SP - 137 EP - 143 K1 - Tricyclic graph K1 - Tetracyclic graph K1 - Eccentric connectivity index 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$. LA eng UL http://ijmsi.ir/article-1-891-en.html M3 ER -