Recommendations
Cites work
- An upper bound on the double Roman domination number
- Domination in graphs with minimum degree two
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- Double Roman domination number
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3536146 (Why is no real title available?)
- scientific article; zbMATH DE number 6889679 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- On the \([1,2]\)-domination number of generalized Petersen graphs
- On the double Roman domination in graphs
- On the double Roman domination of graphs
- Paths, Stars and the Number Three
- Towards a theory of domination in graphs
Cited in
(42)- Some progress on the restrained Roman domination
- Total Roman \(\{2\}\)-reinforcement of graphs
- The domination number of round digraphs
- Restrained condition on double Roman dominating functions
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- A new approach on locally checkable problems
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Perfect Italian domination in graphs: complexity and algorithms
- On the outer independent double Roman domination number
- Maximal double Roman domination in graphs
- Triple Roman domination in graphs
- Perfect Italian domination in cographs
- Outer independent Roman dominating functions in graphs
- Varieties of Roman domination. II
- Bounds on the outer-independent double Italian domination number
- Outer independent Roman domination number of trees
- On the outer-independent double Italian domination number
- The total co-independent domination number of some graph operations
- Algorithmic aspects of outer independent Roman domination in graphs
- Total double Roman domination numbers in digraphs
- Total k-rainbow reinforcement number in graphs
- Quadruple Roman domination in graphs
- On the outer independent total double Roman domination in graphs
- Unique response Roman domination: complexity and algorithms
- An improved upper bound on the independent double Roman domination number of trees
- Further results on independent double roman trees
- Bounds on the outer-independent Roman domination number of unicyclic and bicyclic graphs
- Disprove of a conjecture on the double Roman domination number
- Double Roman domination in graphs: algorithmic complexity
- On [ k ] -Roman domination in graphs
- New results on quadruple Roman domination in graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- New bounds on the outer-independent total double Roman domination number
- The k-th Roman domination problem is polynomial on interval graphs
- Outer-independent Roman domination on Cartesian product of paths
- More results on the outer-independent triple Roman domination number
- Lower bounds on signed total double Roman k-domination in graphs
- On double Roman domination problem for several graph classes
- Further results on outer independent triple Roman domination
- Algorithmic aspects of outer-independent double Roman domination in graphs
- Outer-independent triple Roman domination
- Algorithmic aspects of total Roman and total double Roman domination in graphs
This page was built for publication: Outer independent double Roman domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284046)
