Let G be a connected graph. For a vertex u Î V(G) and an ordered k-partition II = {S1,S2,…,Sk} of V(G), the representation of u with respect to II is the k-vector r(u÷II) = (d(u,S1),d(u,S2),…,d(u,Sk)) where d(u,Si) = min d(u,w)(1 £ i £ k). The k-partition II is said to be resolving if the k-vectors r(u÷II), u Î V(G), are distinct. The minimum k for which there is a resolving k-partition of V(G) is called the partition dimension of G, denoted by pd(G). In this paper, we give upper bounds for the cardinality of vertices in some wheel related graphs namely gear graph, helm, sunflower and friendship graph with given partition dimension k.