# A New Method for Computing the Eccentric Connectivity Index of Fullerenes

Ghorbani, Modjtaba; Malekjani, Khadijeh

Serdica Journal of Computing (2012)

- Volume: 6, Issue: 3, page 299-308
- ISSN: 1312-6555

## Access Full Article

top## Abstract

top## How to cite

topGhorbani, Modjtaba, and Malekjani, Khadijeh. "A New Method for Computing the Eccentric Connectivity Index of Fullerenes." Serdica Journal of Computing 6.3 (2012): 299-308. <http://eudml.org/doc/219527>.

@article{Ghorbani2012,

abstract = {ACM Computing Classification System (1998): G.2.2, G.2.3.The eccentric connectivity index of the molecular graph G, ξ^c (G), was proposed by Sharma, Goswami and Madan. It is defined as
ξ^c (G) = Σu∈V(G)degG(u) ecc(u), where degG(x) denotes the degree of the vertex x in G and ecc(u) = Max\{d(x, u) | x ∈ V (G)\}. In this paper this graph invariant is computed for an infinite class of fullerenes by means of group action.},

author = {Ghorbani, Modjtaba, Malekjani, Khadijeh},

journal = {Serdica Journal of Computing},

keywords = {Eccentric Connectivity Index; Eccentricity; Fullerene; Diameter of Graph; eccentric connectivity index; eccentricity; fullerene; diameter of graph},

language = {eng},

number = {3},

pages = {299-308},

publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},

title = {A New Method for Computing the Eccentric Connectivity Index of Fullerenes},

url = {http://eudml.org/doc/219527},

volume = {6},

year = {2012},

}

TY - JOUR

AU - Ghorbani, Modjtaba

AU - Malekjani, Khadijeh

TI - A New Method for Computing the Eccentric Connectivity Index of Fullerenes

JO - Serdica Journal of Computing

PY - 2012

PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences

VL - 6

IS - 3

SP - 299

EP - 308

AB - ACM Computing Classification System (1998): G.2.2, G.2.3.The eccentric connectivity index of the molecular graph G, ξ^c (G), was proposed by Sharma, Goswami and Madan. It is defined as
ξ^c (G) = Σu∈V(G)degG(u) ecc(u), where degG(x) denotes the degree of the vertex x in G and ecc(u) = Max{d(x, u) | x ∈ V (G)}. In this paper this graph invariant is computed for an infinite class of fullerenes by means of group action.

LA - eng

KW - Eccentric Connectivity Index; Eccentricity; Fullerene; Diameter of Graph; eccentric connectivity index; eccentricity; fullerene; diameter of graph

UR - http://eudml.org/doc/219527

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.