دوره 11، شماره 1 - ( 1-1395 )                   جلد 11 شماره 1 صفحات 137-143 | برگشت به فهرست نسخه ها

XML Print


چکیده:  

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$.

نوع مطالعه: پژوهشي | موضوع مقاله: تخصصي