A Roman domination chain (Q5964976)

For a simple graph \(G=(V,E)\), a Roman dominating function \(f:V\rightarrow \{0,1,2\}\) has the property that every vertex \(v\in V\) with \(f(v)=0\) has a neighbor \(u\) with \(f(u)=2\). The Roman domination number of \(G\) is the minimum weight of a Roman dominating function on \(G\), which is defined as \(f(V)=\sum_{v\in V} f(v)\). The Roman domination number is denoted by \(\gamma_{\mathrm{R}}(G)\). Motivated by the definition of the upper domination number, the authors define the Roman independence domination number, the upper Roman domination number and the upper and lower Roman irredundance number of \(G\). The well-known domination chain, which was established by \textit{E. J. Cockayne} et al. [Can. Math. Bull. 21, 461--468 (1978; Zbl 0393.05044)], is the following chain of inequalities: \[ \mathrm{ir}(G)\leq \gamma(G)\leq i(G) \leq \beta_0(G)\leq \Gamma(G)\leq \mathrm{IR}(G). \] The authors show that the above chain is true for Roman domination: \[ \mathrm{ir}_{\mathrm{R}}(G)\leq \gamma_{\mathrm{R}}(G)\leq i_{\mathrm{R}}(G) \leq \beta_{\mathrm{R}}(G)\leq \Gamma_{\mathrm{R}}(G)\leq \mathrm{IR}_{\mathrm{R}}(G). \] They also develop sharpness, strictness and bounds for the Roman domination chain inequalities and conclude with some open problems.