Split Domination in Various Special Graphs

Abstract

In this research, presented a notion of (G) SD  set (SDS) in a graph G(V,E). A set S of nodes
of G is a SD set of G , if the sub graph <V-S> is not connected. A (G) SD  set in a graph G is
a SDS that holds no SD set as a proper subset. A  set of minimum cardinality is a (G) SD 
set and contains ( ) SD  G nodes. Further investigate the SDS and (G) SD  number of several
special graphs.