Independent double Roman domination in graphs
From MaRDI portal
Publication:4956191
DOI10.1016/j.akcej.2020.02.001zbMath1468.05213OpenAlexW3048258632MaRDI QIDQ4956191
Hamid Reza Maimani, Mostafa Momeni, Farhad Rahimi Mahid, Seyyed Mahmoud Sheikholeslami
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2020.02.001
Related Items (6)
Lower and upper bounds on independent double Roman domination in trees ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Further results on independent double roman trees ⋮ On [ k -Roman domination in graphs] ⋮ Quadruple Roman domination in graphs ⋮ Double Roman domination subdivision number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- On the well-coveredness of Cartesian products of graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Independent Roman \(\{2 \}\)-domination in graphs
- Double Roman domination in trees
- Independent double Roman domination in graphs
- On the double Roman domination in graphs
- Independent rainbow domination of graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On the Number ofk-Dominating Independent Sets
- Extremal Problems for Roman Domination
- Double Roman domination and domatic numbers of graphs
- A note on the independent Roman domination in unicyclic graphs
- An upper bound on the double Roman domination number
This page was built for publication: Independent double Roman domination in graphs