Some properties of double Roman domination
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\).
- Asymptotic Laplacian-energy-like invariant of lattices
- Bounds for signed double Roman
- Double Roman domination
- Double Roman domination in trees
- Extremal problems on weak Roman domination number
- Handbook of product graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- Double Roman domination in trees
- A characterization of double Roman trees
- Double Roman domination number
- Restrained condition on double Roman dominating functions
- Double Roman domination in generalized Petersen graphs
- On the global double Roman domination of graphs
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- Extremal digraphs for an upper bound on the double Roman domination number
- On the double Roman domination of graphs
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Properties of double Roman domination on cardinal products of graphs
- Global double Roman domination in graphs
- Characterization of double Roman trees.
- Double Roman stable graphs.
- Double Roman trees.
- Total double Roman domination in graphs
- A linear algorithm for double Roman domination of proper interval graphs
- A note on the Italian domination number and double Roman domination number in graphs
- Critical concept for double Roman domination in graphs
- The double Roman domination number of generalized Sierpiński graphs
- Double Roman reinforcement number in graphs
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Double Roman domination number of middle graph
- Inverse double Roman domination in graphs
- Domination parameters of generalized Sierpiński graphs
- Double Roman domination in some graphs
This page was built for publication: Some properties of double Roman domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195491)
