Double Roman Domination

Problem Definition

(from beeler.2016)

For a graph G=(V,E)

a double Roman dominating function is a function

f:V→{0,1,2,3}

having the property that

Solution

Meta Heuristics

Agarwal et. al. 24

ACO Solution

Star Graph: K1,n−1

Double Roman Domination|302x351

γdR(K1,n−1)=3

Resources

Bipartite Graph

TBD

Github Repos

Double Roman Domination-1754424007701.webp