Independent Roman \(\{2 \}\)-domination in graphs
From MaRDI portal
Publication:1693166
DOI10.1016/j.dam.2017.10.028zbMath1377.05145OpenAlexW2770588060MaRDI QIDQ1693166
Mustapha Chellali, Abdelkader Rahmouni
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.028
Related Items (17)
On the Italian reinforcement number of a digraph ⋮ Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ Further results on the independent Roman domination number of graphs ⋮ On the independent double Roman domination in graphs ⋮ Graphs with large Italian domination number ⋮ Independent double Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Independent roman $\{3\}$-domination ⋮ Italian domination in the Cartesian product of paths ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Varieties of Roman Domination ⋮ Rainbow Domination in Graphs ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ Roman \(\{2\}\)-domination problem in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Bounds on the 2-rainbow domination number of graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- On the well-coveredness of Cartesian products of graphs
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
This page was built for publication: Independent Roman \(\{2 \}\)-domination in graphs
