| Authors | M. Tavakoli , F. Rahbarnia and A. R Ashrafi |
|---|---|
| Journal | Iranian Journal of Mathematical Sciences and Informatics |
| Page number | 137-143 |
| Serial number | 1 |
| Volume number | 11 |
| Paper Type | Full Paper |
| Published At | 2016 |
| Journal Grade | Scientific - research |
| Journal Type | Typographic |
| Journal Country | Iran, Islamic Republic Of |
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$.