A New Method for Computing the Eccentric Connectivity Index of Fullerenes


Autoria(s): Ghorbani, Modjtaba; Malekjani, Khadijeh
Data(s)

03/12/2012

03/12/2012

2012

Resumo

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.

Identificador

Serdica Journal of Computing, Vol. 6, No 3, (2012), 299p-308p

1312-6555

http://hdl.handle.net/10525/1934

Idioma(s)

en

Publicador

Institute of Mathematics and Informatics Bulgarian Academy of Sciences

Palavras-Chave #Eccentric Connectivity Index #Eccentricity #Fullerene #Diameter of Graph
Tipo

Article