Graceful labeling of bi-partite related graphs

In this paper we have shown that the the splitting graph of the complete bi-partite graph $K_{m,;n}$ is graceful and the tensor product of the complete bi-partite graph $K_{m,;n}$ and a path graph $P_k (k>1)$ is also graceful.