• SPLIT DOMINATION IN DIRECTED GRAPHS

Abstract

Dominating sets in digraphs is analysed in the paper entitled “Total and connected domination in digraphs” by S.Arumugam, K.Jacob and Lutzvolkmann. Let D=(V, A) be a digraph. A subset S of V is called a dominating set of  D if for every vertex v V-S  there exists a vertex u S such that (u, v) A. Split dominating number introduced by Kulli and Janakiram, “Split domination number of a graph”. A dominating set S of V is called Split dominating set of D if the induced subdigraph <V-S> is disconnected. In this paper we analyse the domination parameters corresponding to split domination in digraphs and obtain several results on these parameters.