Title of article
Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Author/Authors
Tavakoli ، M. Department of Mathematics - Ferdowsi University of Mashhad , Rahbarnia ، F. Department of Pure Mathematics - Faculty of Mathematical Sciences - Ferdowsi University of Mashhad , Ashrafi ، A. R Department of Pure Mathematics - Institute of Nanoscience and Nanotechnology, Faculty of Mathematical Sciences - University of Kashan
From page
137
To page
143
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 nvertex 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
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Record number
2506000
Link To Document