The split domination number of a prism graph.

A dominating set D of a graph is a split dominating set if the induced subgraph of is disconnected. The split domination number is the minimum cardinality of split dominating set of a graph G. In this paper, we establish some results on split domination in prism graphs. Particularly, we characterize the split domination in prism graph in terms of order and prism doublers of a dumble graph. Also, we characterize the domination and split domination in prism of corona graphs

Bi-Conditional Domination Related Parameters of a Graph – I

In a graph G = (V;E), a set D V is a dominating set of G. TheBi-conditional domination number (G : Pi) for 1 6 i 6 6, is the minimumcardinality of a dominating set D such that induced subgraph ⟨D⟩ and ⟨