Roman domination dot-critical trees

A Roman dominating function on a graph G is a function f: V(G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. T...