Bounds on the double Italian domination number of a graph

For a graph G, a Roman f3g-dominating function is a function f : V 􀀀f0; 1; 2; 3g having the property that for every vertex u 2 V , if f(u) 2 f0; 1g,then f(Nu) 3. The weight of a Roman f3g-domin