"

Cookies ussage consent

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

Eccentric connectivity polynomial of triangular benzenoid

M. GHORBANI1,* , A. AZAD1, M. GHASEMI1

Affiliation

  1. Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran, 16785-136, I. R. Iran, Department of Mathematics, Faculty of Sciences, Arak University, Arak, 38156,

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