Let G be a graph, e = uv ∈ E( G ), nu(e) be the number of vertices of G lying closer to u than to v and nv(e) be the number of vertices of G lying closer to v than to u. The vertex PI and Szeged polynomials of the graph G are defined as PI v( G ,x) = ∑e = uv xnu (e) + nv (e) and Sz ( G ,x) = ∑e = uv xnu (e)nv (e), respectively. In this paper, these counting polynomials for an infinite family of IPR fullerenes are computed.