Strong equality between the Roman domination and independent Roman domination numbers in trees
Mustapha Chellali, Nader Jafari Rad · Discussiones Mathematicae Graph Theory · 2012
A Roman dominating function (RDF) on a graph G = (V, E) is a function f : V -→ {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.The weight of an RDF is the valueIn this paper we provide a constructive characterization of trees T with γ R (T ) ≡ i R (T ).