Independent double Roman domination in graphs

For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at least a neighbor with value 2 or 3. The weight of a DRDF is the sum . A DRDF f is called independent if the set of vertices with positive weight under f, is an independent set. The independent double Roman domination number is the minimum weight of an independent double Roman dominating function on G. In this paper, we show that for every graph G of order n, and , where and i(G) are the independent 3-rainbow domination, independent Roman domination and independent domination numbers, respectively. Moreover, we prove that for any tree G, .