K-Isolate Domination in Directed Graphs

Abstract

A vertex set of a graph G ⃗ said to be a kIDS if <D> has exactly k isolated vertices and V(G ⃗) is the union of the closed out neighborhoods of vertices in D. This paper does include some basic properties of kIDS in directed graph and provide the kID number for cycles, paths and some special graphs in digraph that has been discussed.