Double Roman domination number
From MaRDI portal
Publication:1752604
DOI10.1016/j.dam.2018.03.026zbMath1387.05186OpenAlexW2794674653MaRDI QIDQ1752604
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.026
Related Items (15)
Integer linear programming formulations for double roman domination problem ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Outer independent signed double Roman domination ⋮ On the outer independent double Roman domination number ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ The restrained double Roman domination in graphs ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Outer independent double Roman domination ⋮ Complexity of Roman {2}-domination and the double Roman domination in graphs ⋮ Algorithmic results on double Roman domination in graphs ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ Perfect double Roman domination of trees ⋮ Critical concept for double Roman domination in graphs ⋮ The double Roman domination number of generalized Sierpiński graphs
Cites Work
- Double Roman domination
- Defending the Roman Empire---a new strategy
- 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
- Weak Roman domination in graphs
- Extremal Problems for Roman Domination
- Total Roman domination in graphs
- A textbook of graph theory
This page was built for publication: Double Roman domination number
