An upper bound on the double Roman domination number
From MaRDI portal
(Redirected from Publication:5895065)
An upper bound on the double Roman domination number (scientific article; zbMATH DE number 6910544)
An upper bound on the double Roman domination number (scientific article; zbMATH DE number 6910544)
Recommendations
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- A note on the double Roman domination number of graphs.
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Double Roman domination in trees
- On the double Roman domination in graphs
- Some progress on the double Roman domination in graphs
- scientific article; zbMATH DE number 7478539
- Double Roman domination
- Characterization of double Roman trees.
- Double Roman domination and domatic numbers of graphs
Cites work
- Bounds on the locating Roman domination number in trees
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire---a new strategy
- Domination in graphs with minimum degree two
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On the double Roman domination in graphs
- Roman domination in graphs.
- The distance Roman domatic number of a graph
Cited in
(40)- Signed double Roman domination in graphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Outer independent signed double Roman domination
- Double Roman domination in generalized Petersen graphs
- On the global double Roman domination of graphs
- Outer independent double Roman domination
- Algorithmic results on double Roman domination in graphs
- Independent double Roman domination in graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- 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
- On the differential and Roman domination number of a graph with minimum degree two
- A note on the double Roman domination number of graphs.
- On the double Roman domination number in trees
- Varieties of Roman Domination
- Signed double Roman \(k\)-domination in graphs
- Independent double Roman domination in graphs
- Bounds on signed total double Roman domination
- Properties of double Roman domination on cardinal products of graphs
- scientific article; zbMATH DE number 7478539 (Why is no real title available?)
- Integer linear programming formulations for double Roman domination problem
- Lower and upper bounds on independent double Roman domination in trees
- Bounds for signed double Roman
- Critical concept for double Roman domination in graphs
- The double Roman domination number of generalized Sierpiński graphs
- Double Roman domination subdivision number in graphs
- An upper bound on the double Roman domination number
- An improved upper bound on the independent double Roman domination number of trees
- Disprove of a conjecture on the double Roman domination number
- An upper bound on triple Roman domination
- New results on quadruple Roman domination in graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Domination parameters of generalized Sierpiński graphs
- Double Roman domination in some graphs
- Double Roman domination in Cartesian product
- Double Roman domination stability in graphs
- Bounds on the total double Roman domination number of graphs
- Double Roman and double Italian domination
- On double Roman domination problem for several graph classes
- Perfect double Roman domination of trees
This page was built for publication: An upper bound on the double Roman domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895065)
