Eccentric connectivity polynomial of wheel related graphs

Let G = (V(G), E(G)) be a graph. The eccentric connectivity polynomial of G is defined as where the eccentricity ε_G(V_i)for a given vertex v_i of V(G), is the largest distance from v_i to any other vertices of G. In this paper, I present the eccentric connectivity polynomial of wheel related graphs namely closed helm, double wheel, flower graph, sunflower graph and a graph by sharing one vertex of wheel W_n with the path of length n.