Independent Roman \2 \-domination in graphs
From MaRDI portal
Publication:1693166
DOI10.1016/J.DAM.2017.10.028zbMATH Open1377.05145OpenAlexW2770588060MaRDI QIDQ1693166FDOQ1693166
Authors: Abdelkader Rahmouni, Mustapha Chellali 
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
Recommendations
- On the independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Further results on the independent Roman domination number of graphs
- Note on the independent Roman domination number of a graph
- Independent Roman domination and 2-independence in trees
- Independent \((1, 2)\)-domination in graphs
- Properties of independent Roman domination in graphs
- Total Roman \(\{2\}\)-domination in graphs
- Outer-independent total Roman domination in graphs
Cites Work
- 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
- Roman \(\{2 \}\)-domination
- On 2-rainbow domination and roman domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Title not available (Why is that?)
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On the well-coveredness of Cartesian products of graphs
- Independent 2-rainbow domination in graphs
Cited In (19)
- Title not available (Why is that?)
- Independent roman $\{3\}$-domination
- Rainbow Domination in Graphs
- A note on the independent Roman domination in unicyclic graphs
- On the Italian reinforcement number of a digraph
- Italian domination in the Cartesian product of paths
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Total Roman \(\{2\}\)-reinforcement of graphs
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- Graphs with large Italian domination number
- Complexity aspects of variants of independent Roman domination in graphs
- Further results on the independent Roman domination number of graphs
- Varieties of Roman Domination
- Roman \(\{2\}\)-domination problem in graphs
- On the independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
- Outer-independent total Roman domination in graphs
- Title not available (Why is that?)
This page was built for publication: Independent Roman \(\{2 \}\)-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693166)
