Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1934

 Title: A New Method for Computing the Eccentric Connectivity Index of Fullerenes Authors: Ghorbani, ModjtabaMalekjani, Khadijeh Keywords: Eccentric Connectivity IndexEccentricityFullereneDiameter of Graph Issue Date: 2012 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 6, No 3, (2012), 299p-308p Abstract: 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. Description: ACM Computing Classification System (1998): G.2.2, G.2.3. URI: http://hdl.handle.net/10525/1934 ISSN: 1312-6555 Appears in Collections: Volume 6 Number 3

Files in This Item:

File Description SizeFormat