Independent domination number in Cayley digraphs of rectangular groups
Nuttawoot Nupo, Sayan Panma · Discrete Mathematics Algorithms and Applications · 2018
Let [Formula: see text] denote the Cayley digraph of the rectangular group [Formula: see text] with respect to the connection set [Formula: see text] in which the rectangular group [Formula: see text] is isomorphic to the direct product of a group, a left zero semigroup, and a right zero semigroup. An independent dominating set of [Formula: see text] is the independent set of elements in [Formula: see text] that can dominate the whole elements. In this paper, we investigate the independent domination number of [Formula: see text] and give more results on Cayley digraphs of left groups and right groups which are specific cases of rectangular groups. Moreover, some results of the path independent domination number of [Formula: see text] are also shown.