A note on the Roman domatic number of a digraph
From MaRDI portal
Publication:5212896
DOI10.22049/cco.2019.26419.1107zbMath1449.05205OpenAlexW2994540344MaRDI QIDQ5212896
Publication date: 30 January 2020
Full work available at URL: https://doaj.org/article/416c547da61a4a8f977a4b96841ee256
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The roman domatic number of a graph
- Efficient algorithms for Roman domination on some classes of graphs
- On the Roman domination number of a graph
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal Problems for Roman Domination
- A characterization of Roman trees
This page was built for publication: A note on the Roman domatic number of a digraph