Split Domination in Normal Product of Paths and Cycles

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 γ sub s /sub (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 P sub m /sub ⊕ P sub n /sub , P sub m /sub ⊕ C sub n /sub and C sub m /sub ⊕ C sub n /sub .