Let κ(G) be the connectivity of G and G×H the direct product of G and H. We prove that for any graphs G and K, with n≥3,κ(G×Kn)=min{nκ(G),(n−1)δ(G)}, which was conjectured by Guji and Vumar.