For a vertex v of a connected graph G ( V , E ) and a subset S of V , the distance between v and S is defined by d ( v , S )=min{ d ( v , x ):x∈ S }. For an ordered k .-partition Π={ S 1 , S 2 ,…, S k } of V , the representation of v with respect to Π is the k -vector r ( v ∣Π)=( d ( v , S 1 ), d ( v , S 2 ),…, d ( v , S k )). The k -partition Π is a resolving partition if the k -vectors r(v∣Π), v ∈ V are distinct. The minimum k for which there is a resolving k -partition of V is the partition dimension of G . In this paper, we obtain the partition dimension of circulant graphs [formula cannot be replicated]