Triple Roman domination in graphs
From MaRDI portal
Publication:2661014
DOI10.1016/j.amc.2020.125444zbMath1462.05266OpenAlexW3092092571MaRDI QIDQ2661014
Publication date: 1 April 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125444
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (24)
A new approach on locally checkable problems ⋮ Global triple Roman dominating function ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ The signed edge-domatic number of nearly cubic graphs ⋮ Triple Roman domination subdivision number in graphs ⋮ Total double Roman domination numbers in digraphs ⋮ On [k-Roman domination subdivision number of graphs] ⋮ On [ k -Roman domination in graphs] ⋮ New results on quadruple Roman domination in graphs ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Maximal double Roman domination in graphs ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ The domination number of round digraphs ⋮ Double Roman reinforcement number in graphs ⋮ Quadruple Roman domination in graphs ⋮ Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle ⋮ Double Roman domination subdivision number in graphs
Cites Work
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in graphs.
- Mixed Roman domination in graphs
- Double Roman domination in trees
- Signed double Roman domination in graphs
- Defending the Roman Empire---a new strategy
- Linear time solvable optimization problems on graphs of bounded clique-width
- Total Roman \(\{2\}\)-dominating functions in graphs
- Outer independent double Roman domination
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Double Roman domination and domatic numbers of graphs
- Integer linear programming formulations for double roman domination problem
- Signed double roman domination of graphs
- Total double Roman domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Triple Roman domination in graphs
