Title : ( Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity )
Authors: Mostafa Tavakoli , Freydoon Rahbarnia , Ali Reza Ashrafi ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
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 Cn and Dn 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 Cn and Dn.
Keywords
, Tricyclic graph, Tetracyclic graph, Eccentric connectivity index
@article{paperid:1056073,
author = {Tavakoli, Mostafa and Rahbarnia, Freydoon and Ali Reza Ashrafi},
title = {Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
year = {2016},
volume = {11},
number = {1},
month = {May},
issn = {1735-4463},
pages = {137--143},
numpages = {6},
keywords = {Tricyclic graph; Tetracyclic graph; Eccentric connectivity index},
}
%0 Journal Article
%T Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
%A Tavakoli, Mostafa
%A Rahbarnia, Freydoon
%A Ali Reza Ashrafi
%J Iranian Journal of Mathematical Sciences and Informatics
%@ 1735-4463
%D 2016
