A graph H is said to be a product cordial graph if there is a mapping g from V(H) to {0,1} such that if each line rt is given the value g(r).g(t), then the cardinality of points with value 0 and the cardinality of points with value 1 differ at most by 1 and the cardinality of lines with value 0 and the cardinality of lines with value 1 differ by at most 1. In this case, g is said to be a product cordial labeling of G. In this paper, we investigate the product cordial labeling of some snake related graphs such as D(T_p )⊙(K_1 ) ̅,D(T_p )⊙(K_2 ) ̅,D(T_p )⊙(K_3 ) ̅,D(Q_p )⊙(K_1 ) ̅,D(Q_p)⊙(K_2 ) ̅ and D(Q_p)⊙(K_3 ) ̅.