Double Roman reinforcement number in graphs
From MaRDI portal
Publication:5861712
DOI10.1080/09728600.2021.1997557zbMath1483.05109OpenAlexW3213861259MaRDI QIDQ5861712
No author found.
Publication date: 2 March 2022
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2021.1997557
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS ⋮ Triple Roman domination subdivision number in graphs ⋮ Quasi-total Roman reinforcement in graphs ⋮ Restrained Italian reinforcement number in graphs ⋮ Restrained k-rainbow reinforcement number in graphs
Cites Work
- Double Roman domination
- The \(k\)-rainbow reinforcement numbers in graphs
- Roman domination in graphs.
- Total Roman reinforcement in graphs
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- On the double Roman domination in graphs
- Triple Roman domination in graphs
- Varieties of Roman Domination
- Roman Domination in Graphs
- Double Roman domination and domatic numbers of graphs
- Varieties of Roman domination II
- Bounds on signed total double Roman domination
- Total double Roman domination in graphs
- Total k-rainbow reinforcement number in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Double Roman reinforcement number in graphs