On 2-rainbow domination and roman domination in graphs (Q2848725)

A 2-rainbow dominating function of a graph \(G\) is a function \(g\) from \(V(G)\) to the power set of \(\{1,2\}\) such that if \(g(v)=\emptyset\) then \(\bigcup_{u\in N(v)} g(u)= \{1,2\}\). The 2-rainbow domination number \(\gamma_{r2}(G)\) is the minimum of \(\sum_{v\in V}|g(v)|\) taken over all 2-rainbow dominating functions \(g\). It is proved that \(\gamma_R(G)/\gamma_{r2}(G) \leq 3/2\) holds for any graph \(G\), where \(\gamma_R(G)\) denotes the Roman domination number of \(G\). The bound is improved to \(4/3\) in the case of trees. Several additional upper bounds on the 2-rainbow domination number are given.