On k-rainbow independent domination in graphs

In this paper, we define a new domination invariant on a graph $G$, which coincides with the ordinary independent domination number of the generalized prism $G \Box K_k$, called the $k$-rainbow independent domination number and denoted by $\gamma_{{\rm ri}k}(G)$. Some bounds and exact values concerning this domination concept are determined. As a main result, we prove a Nordhaus-Gaddum-type theorem on the sum for $2$-rainbow independent domination number, and show if G is a graph of order $n \geq 3$, then $5\leq \gamma_{{\rm ri}2}(G)+\gamma_{{\rm ri}2}(\overline{G})\leq n+3$, with both bounds being sharp.