Quadruple Roman domination in graphs
From MaRDI portal
Publication:5866033
DOI10.1142/S1793830921501305zbMath1487.05189MaRDI QIDQ5866033
Publication date: 10 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Related Items (5)
Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Triple Roman domination subdivision number in graphs ⋮ On [k-Roman domination subdivision number of graphs] ⋮ On [ k -Roman domination in graphs] ⋮ New results on quadruple Roman domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Double Roman domination
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in graphs.
- Signed double Roman domination in graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- The Roman domatic problem in graphs and digraphs: a survey
- Outer independent double Roman domination
- Independent double Roman domination in graphs
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- Triple Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Varieties of Roman Domination
- Roman Domination in Graphs
- Double Roman domination and domatic numbers of graphs
- Independent double Roman domination in graphs
- Varieties of Roman domination II
- Bounds on signed total double Roman domination
- Total double Roman domination in graphs
This page was built for publication: Quadruple Roman domination in graphs