  The {\it crossing number} of a graph $G$ is the minimum number of pairwise
intersections of edges in a drawing of $G$. In this paper, we study the
crossing numbers of $K_{m}\times P_n$ and $K_{m}\times C_n$.
