2-Rainbow domination number of circulant graphs C(n; {1,4})

Ramy Shaheen, Suhail Mahfud, Mohammed Fahed Adrah

Let $k$ be a positive integer. A $k$-rainbow domination function (kRDF) of a graph $G$ is a function $f$ from $V(G)$ to the set of all subsets of $\{1,2,\dots ,k\}$ such that every…