A graph G=(V(G),E(G)) is said to be a product cordial graph if there exists a function g from V(G) to {0,1} such that if each line rt is give the label g(r),g(t), then the number of points with label 0 and the number of points with label 1 differ atmost by 1 and the number of lines with label 0 and the number of lines with label 1 differ by atmost 1. In this case g is said to be a product cordial labelling of G. In this paper we investigate the product cordial labelling of circular ladder related graphs and we prove that the graphs such as CL_((n) ) ⨀ K_1,CL_((n) ) ⨀ K_2 and CL_((n) ) ⨀ (K_2 ) ̅,k- path union of two copies of circular ladder, path union of m copies of circular ladder all are Product cordial graphs.