on independent domination numbers of grid and toroidal grid directed graphs

A subset s of vertex set v (d) is an independent dominating set of a digraph d if s is both an independent and a dominating set of d. the independent domination number i(d) is the minimum cardinality of an independent dominating set of d. in this paper we calculate the independent domination number of the cartesian product of two directed paths p_m and p_n for arbitraries m and n. also, we determine the independent domination number of the cartesian product of two directed cycles c_m and c_n for m,n≡0 (mod 3) and n≡0 (mod m). we note that, there are many values of m and n such that cm□cn does not have an independent dominating set.