On the double Roman domination number in trees
From MaRDI portal
Publication:3300702
Authors:
Publication date: 29 July 2020
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/77/ajc_v77_p256.pdf
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Roman domination in graphs.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Double Roman domination
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- On the double Roman domination in graphs
- An upper bound on the double Roman domination number
- Double Roman trees.
Cited In (6)
- New bounds on the double domination number of trees
- Trees with independent Roman domination number twice the independent domination number
- Inverse double Roman domination in graphs
- Lower and upper bounds on independent double Roman domination in trees
- On the global double Roman domination of graphs
- An improved upper bound on the independent double Roman domination number of trees
This page was built for publication: On the double Roman domination number in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300702)
