Integer linear programming formulations for double roman domination problem
Integer linear programming formulations for double roman domination problem
For a graph G=(V,E), a double Roman dominating function (DRDF) is a function f:V→{0,1,2,3} having the property that if f(v)=0, then vertex v must have at least two neighbours assigned 2 under f or at least one neighbour u with f(u)=3, and if f(v)=1, then vertex v must have at …