Double Roman domination stability in graphs
From MaRDI portal
Cites work
- 2-rainbow domination stability of graphs
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- An upper bound on the double Roman domination number
- Disjunctive total domination stability in graphs
- Disprove of a conjecture on the double Roman domination number
- Domination alteration sets in graphs
- Double Roman and double Italian domination
- Double Roman domination
- Double Roman domination in digraphs
- Double Roman domination in graphs: algorithmic complexity
- Double Roman domination in trees
- On the 2-rainbow domination stable graphs
- On the double Roman domination in graphs
- Paired domination stability in graphs
- Roman domination in graphs
- Roman domination in graphs.
- Some progress on the double Roman domination in graphs
- Total and paired domination stability in prisms
- Total domination stability in graphs
- Varieties of Roman Domination
- Varieties of Roman domination. II
This page was built for publication: Double Roman domination stability in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982328)