Assume that Kj × n is a complete and multipartite graph consisting of j partite sets and n vertices in each partite set. For the given graphs G1, G2, …, Gn, the multipartite Ramsey number (M-R-number) mj(G1,G2,…,Gn), is the smallest integer t, such that for any n-edge-coloring (G1,G2,…,Gn) of the edges of Kj × t, Gi contains a monochromatic copy of Gi for at least one i. The size of M-R-number mj(nK2,Cm) for j, n ≥ 2 and 4 ≤ m ≤ 6, the size of M-R-number mj(nK2,C7) for j ≥ 2 and n ≥ 2, the size of M-R-number mj(nK2,K3) for each j, n ≥ 2, the size of M-R-number mj(K3,K3,n1K2,n2K2,…,niK2) for j ≤ 6 and i, ni ≥ 1, and the size of M-R-number mj(K3,K3,nK2) for j ≥ 2 and n ≥ 1 have been computed in several previously published papers. In this article, we obtain the values of M-R-number mj(Km,nK2) for j, n ≥ 2 and m ≥ 4.