Global double Roman domination in graphs
From MaRDI portal
Publication:5030493
DOI10.1080/09720529.2019.1569833zbMath1495.05241OpenAlexW2912569373MaRDI QIDQ5030493
Shaohui Wang, Zehui Shao, Seyyed Mahmoud Sheikholeslami, Sakineh Nazari-Moghaddam
Publication date: 17 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1569833
Related Items (2)
On the global double Roman domination of graphs ⋮ Algorithmic results on double Roman domination in graphs
Cites Work
- Double Roman domination
- Roman domination on strongly chordal graphs
- Roman domination number of the Cartesian products of paths and cycles
- On roman, global and restrained domination in graphs
- Upper bounds on Roman domination numbers of graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Double Roman domination in trees
- The total global domination number of a graph
- Global Roman domination in trees
- On the double Roman domination in graphs
- Roman domination in unicyclic graphs
- Roman Domination on 2-Connected Graphs
- Fractional global domination in graphs
- Roman domination in Cartesian product graphs and strong product graphs
- A note on the independent domination number versus the domination number in bipartite graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global double Roman domination in graphs