Changing and unchanging the roman domination number of graph (Q2839667)

In the paper there are studied vertex and edge critical graphs with respect to the Roman domination number. A Roman dominating function is a function defined on the vertex set \(V\) of a graph \(G=(V,E)\) with values 0,1 or 2. Each vertex \(u\) with \(f(u)=0\) is dominated by at least one vertex \(v\) with \(f(v)=2\). The weight of a Roman dominating function is defined as the sum of its values for all vertices in \(V\). The Roman dominating number \(\gamma _R(G)\) of a graph \(G\) is the minimal weight of a Roman dominating function defined on \(V\). The graph \(G\) is said to be vertex critical if removing any vertex from \(V\) implies a change of \(\gamma _R(G)\), and it is said to be edge critical if removing any edge from \(E\) implies the change of \(\gamma _R(G)\). The authors present necessary and sufficient conditions for graphs to be vertex or edge critical with respect to the Roman dominating number.