Split Line Domination in Graphs

A line dominating set is a split line dominating set, if the subgraph is disconnected. The minimum cardinality of vertices in such a set is called a split line domination number in and is denoted by. In this paper, we introduce the new concept in domination theory. Also, we study the graph theoretic properties of and many bounds were obtained in terms of elements of and its relationships with other domination parameters were found.