Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire---a new strategy
- Domination in graphs with minimum degree two
- Extremal problems for roman domination
- Paths, Stars and the Number Three
- 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
Cited in
(only showing first 100 items - show all)- Double Roman domination in trees
- On the total Roman domination in trees
- Perfect Italian domination in trees
- Some properties of double Roman domination
- Double Roman domination number
- On the global double Roman domination of graphs
- A linear algorithm for double Roman domination of proper interval graphs
- On the independent double Roman domination in graphs
- On two open problems concerning weak Roman domination in trees
- Disprove of a conjecture on the double Roman domination number
- Total double Roman domination in graphs
- The double Roman domination number of generalized Sierpiński graphs
- Signed double roman domination of graphs
- Restrained condition on double Roman dominating functions
- Total double Roman domination numbers in digraphs
- Independent double Roman domination in graphs
- An improved upper bound on the independent double Roman domination number of trees
- Further results on independent double roman trees
- On the co-Roman domination in graphs
- Independent double Roman domination in graphs
- On the outer independent double Roman domination number
- Varieties of Roman domination. II
- Double Roman stable graphs.
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- On the double Roman domination of graphs
- Double Roman reinforcement number in graphs
- Double Roman domination subdivision number in graphs
- The Roman domatic problem in graphs and digraphs: a survey
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- On the double Roman domination in graphs
- On the outer-independent double Italian domination number
- Further results on the \([k]\)-Roman domination in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- On the outer independent total double Roman domination in graphs
- A characterization of double Roman trees
- Double Roman trees.
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- The generous Roman domination number
- On the double Roman domination number in trees
- On [ k ] -Roman domination in graphs
- Perfect double Italian domination of a graph
- Critical concept for double Roman domination in graphs
- On algorithmic complexity of double Roman domination
- New results on quadruple Roman domination in graphs
- Maximal double Roman domination in graphs
- Algorithmic results on double Roman domination in graphs
- On the total restrained double Italian domination
- Quadruple Roman domination in graphs
- A note on the double Roman domination number of graphs.
- An upper bound on the double Roman domination number
- On the D-differential of a graph
- Signed double Roman domination in graphs
- On computing secure domination of trees
- Isolate Roman domination in graphs
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
- Integer linear programming formulations for double Roman domination problem
- A new approach on locally checkable problems
- Global triple Roman dominating function
- Properties of double Roman domination on cardinal products of graphs
- Double Roman domination number of middle graph
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Signed total double Roman \(k\)-domination in graphs
- On the double Roman bondage numbers of graphs
- Signed double Roman \(k\)-domination in graphs
- Bounds for signed double Roman
- Algorithm and hardness results in double Roman domination of graphs
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
- Outer independent signed double Roman domination
- Solving the minimum-cost double Roman domination problem
- Double Roman domination in graphs: algorithmic complexity
- An upper bound on triple Roman domination
- Quasi total double Roman domination in trees
- Roman domination number of signed graphs
- Algorithmic complexity of triple Roman dominating functions on graphs
- Outer independent double Roman domination
- Inverse double Roman domination in graphs
- Double Roman domination in digraphs
- Global double Roman domination in graphs
- Bounds on the outer-independent double Italian domination number
- Double Roman domination and domatic numbers of graphs
- A Nordhaus-Gaddum bound for Roman domination
- Triple Roman domination in graphs
- Double Roman domination in generalized Petersen graphs
- Total protection of lexicographic product graphs
- Roman domination in signed graphs
- The double Roman domatic number of a digraph
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Algorithmic aspects of Roman graphs
- Outer independent Roman dominating functions in graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Outer independent double Italian domination: Complexity, characterization
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Unique response Roman domination: complexity and algorithms
- Weak double Roman domination
- Perfect double Roman domination of trees
- Perfect Italian domination in cographs
This page was built for publication: Double Roman domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335328)
