A dominating set D ⊆ V is a split dominating set of a graph G = (V, E) if the induced subgraph of <V - D> is disconnected. The split domination number γs(G) is the minimum cardinality of a split dominating set of a graph G. In this article, we establish some results on split domination number of Pm ⊕ Pn, Pm ⊕ Cn and Cm ⊕ Cn.