دوره 11، شماره 1 - ( 1-1395 )
جلد 11 شماره 1 صفحات 143-137 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Tavakoli M, Rahbarnia F, Ashrafi A R. Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity. IJMSI 2016; 11 (1) :137-143
URL: http://ijmsi.ir/article-1-891-fa.html
URL: http://ijmsi.ir/article-1-891-fa.html
Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity. مجله علوم ریاضی و انفورماتیک. 1395; 11 (1) :137-143
چکیده:
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$.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
