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)}. The eccentricity connectivity polynomial of a molecular graph G is defined as ECP(G,x) = Σa∈V(G)degG(a)xecc(a), where ecc(a) is defined as the length of a maximal path connecting a to another vertex of G. In this paper this polynomial is computed for triangular benzenoid graphs.
Keywords
Eccentric connectivity index, Eccentricity connectivity polynomial, Triangular benzenoid graph.
Citation
M. GHORBANI, A. AZAD, M. GHASEMI, Eccentric connectivity polynomial of triangular benzenoid, Optoelectronics and Advanced Materials - Rapid Communications, 4, 8, August 2010, pp.1268-1269 (2010).
Submitted at: Aug. 1, 2010
Accepted at: Aug. 12, 2010