Roman domination in weighted graphs

Martín Cera, Pedro García-Vázquez, Juan Carlos Valenzuela-Tripodoro

A Roman dominating function for a (non-weighted) graph $G=(V,E)$, is a function $f:V\to \{0,1,2\}$ such that every vertex $u\in V$ with $f(u)=0$ has at least {one} neighbor…