TY - JOUR
T1 - Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
TT -
JF - IJMSI
JO - IJMSI
VL - 11
IS - 1
UR - http://ijmsi.ir/article-1-891-en.html
Y1 - 2016
SP - 137
EP - 143
KW - Tricyclic graph
KW - Tetracyclic graph
KW - Eccentric connectivity index
N2 - 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$.
M3
ER -