Split Litact Domination in Graphs

Abstract

Let  be a graph and   be a litact graph of . Let  be a litact dominating set is said to be a split litact dominating set, if the sub graph  is disconnected. The minimum cardinality of split litact dominating set is called split litact domination number and it is denoted by  . In this paper we investigate different variants of  with other domination variants of  for some established graphs like ,  , ,  Trees, etc. Further the Nordhaus- Gaddum types of results are also established.