Iranian Journal of Mathematical Sciences and Informatics, Volume (11), No (1), Year (2016-5) , Pages (137-143)

Title : ( Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity )

Authors: Mostafa Tavakoli , Freydoon Rahbarnia , Ali Reza Ashrafi ,
File:

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

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