Double Roman domination number
From MaRDI portal
Publication:1752604
Recommendations
Cites work
- A textbook of graph theory
- Defending the Roman Empire---a new strategy
- Double Roman domination
- Extremal problems for roman domination
- On the double Roman domination in graphs
- Signed Roman domination in graphs
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- The differential and the roman domination number of a graph
- Total roman domination in graphs
- Weak Roman domination in graphs
Cited in
(18)- On the outer independent double Roman domination number
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Critical concept for double Roman domination in graphs
- Algorithmic results on double Roman domination in graphs
- Integer linear programming formulations for double Roman domination problem
- Double Roman domination number of middle graph
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Outer independent signed double Roman domination
- Outer independent double Roman domination
- Perfect Italian domination number of graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Outer independent double Italian domination: Complexity, characterization
- Perfect double Roman domination of trees
- Extremal digraphs for an upper bound on the double Roman domination number
- Domination parameters of generalized Sierpiński graphs
- The restrained double Roman domination in graphs
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- The double Roman domination number of generalized Sierpiński graphs
This page was built for publication: Double Roman domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752604)