In a given graph G = (V, E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a at least chromatic coloring of G. In this paper defining number of Cartesian product of some graphs are discussed.
