[Home ] [Archive]    
:: Main :: Current Issue :: Archive :: Search :: Submit :: Contact ::
:: Volume 11, Number 1 (4-2016) ::
IJMSI 2016, 11(1): 137-143 Back to browse issues page
Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
M. Tavakoli, F. Rahbarnia, A. R Ashrafi
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$.

Keywords: Tricyclic graph, Tetracyclic graph, Eccentric connectivity index
Full-Text [PDF 690 kb]      
Type of Study: Research | Subject: Special
Add your comments about this article
Your username or email:

Write the security code in the box >



XML     Print


Download citation:
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-en.html
Volume 11, Number 1 (4-2016) Back to browse issues page
نشریه علوم ریاضی و انفورماتیک Iranian Journal of Mathematical Sciences and Informatics
Persian site map - English site map - Created in 0.054 seconds with 790 queries by yektaweb 3503