Computing eccentric connectivity polynomial of fullerenes

摘要

The eccentricity connectivity polynomial of a molecular graph G is defined as (x) =aV(G)X(a) -where e(a) is defined as the length of a maximal path connecting a to other vertices of G. Fullerenes are 3-connected graphs with exactly 12 pentagonal faces. In this paper this polynomial is computed for an infinite family of fullerenes.