Some properties of double Roman domination (Q2195491)

Summary: A \textit{double Roman dominating function} on a graph \(G\) is a function \(f:V\left( G\right)\longrightarrow\left\{ 0,1,2,3\right\}\) satisfying the conditions that every vertex \(u\) for which \(f\left( u\right)=0\) is adjacent to at least one vertex \(v\) for which \(f\left( v\right)=3\) or two vertices \(v_1\) and \(v_2\) for which \(f\left( v_1\right)=f\left( v_2\right)=2\) and every vertex \(u\) for which \(f\left( u\right)=1\) is adjacent to at least one vertex \(v\) for which \(f\left( v\right)\geq2\). The weight of a double Roman dominating function \(f\) is the value \(f\left( V\right)={\sum\nolimits_{u \in V} f \left( u\right)}\). The minimum weight of a double Roman dominating function on a graph \(G\) is called the \textit{double Roman domination number} \( \gamma_{d R}\left( G\right)\) of \(G\). A graph with \(\gamma_{d R}\left( G\right)=3\gamma\left( G\right)\) is called a \textit{double Roman} graph. In this paper, we study properties of double Roman domination in graphs. Moreover, we find a class of double Roman graphs and give characterizations of trees with \(\gamma_{d R}\left( T\right)= \gamma_R\left( T\right)+k\) for \(k=1,2\).