Double Roman domination
From MaRDI portal
Publication:335328
DOI10.1016/J.DAM.2016.03.017zbMath1348.05146OpenAlexW2346913169MaRDI QIDQ335328
Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.017
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (only showing first 100 items - show all)
On [ k -Roman domination in graphs] ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ New results on quadruple Roman domination in graphs ⋮ Inverse double Roman domination in graphs ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ Unnamed Item ⋮ Total double Roman domination in graphs ⋮ Bounds on signed total double Roman domination ⋮ Integer linear programming formulations for double roman domination problem ⋮ A new approach on locally checkable problems ⋮ Global triple Roman dominating function ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Unnamed Item ⋮ Some progress on the double Roman domination in graphs ⋮ Unnamed Item ⋮ On the outer-independent double Italian domination number ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ Outer independent signed double Roman domination ⋮ Outer independent Roman dominating functions in graphs ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Total protection of lexicographic product graphs ⋮ Double Roman domination in generalized Petersen graphs ⋮ Unnamed Item ⋮ Bounds on the double Italian domination number of a graph ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Signed double roman domination of graphs ⋮ Upper bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ On the outer independent double Roman domination number ⋮ Triple Roman domination in graphs ⋮ Perfect Italian domination in cographs ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ On the double Roman domination in graphs ⋮ On the global double Roman domination of graphs ⋮ On the outer independent total double Roman domination in graphs ⋮ Triple Roman domination subdivision number in graphs ⋮ Total double Roman domination numbers in digraphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Further results on independent double roman trees ⋮ On the D-differential of a graph ⋮ Roman \(\{ 3 \}\)-domination (double Italian domination) ⋮ On the double Roman bondage numbers of graphs ⋮ The restrained double Roman domination in graphs ⋮ Disprove of a conjecture on the double Roman domination number ⋮ Perfect Roman domination in trees ⋮ The double Roman domatic number of a digraph ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ Some properties of double Roman domination ⋮ On the independent double Roman domination in graphs ⋮ Perfect double Italian domination of a graph ⋮ On algorithmic complexity of double Roman domination ⋮ Double Roman domination in trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Independent double Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the co-Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Signed double Roman domination in graphs ⋮ A note on the double Roman domination number of graphs ⋮ An upper bound on the double Roman domination number ⋮ A characterization of double Roman trees ⋮ Perfect Italian domination in trees ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Perfect roman domination in regular graphs ⋮ Maximal double Roman domination in graphs ⋮ Double Roman domination number ⋮ An upper bound on the double Roman domination number ⋮ Double Roman domination in digraphs ⋮ Outer independent double Roman domination ⋮ Varieties of Roman domination II ⋮ Complexity of Roman {2}-domination and the double Roman domination in graphs ⋮ Algorithmic results on double Roman domination in graphs ⋮ Signed total double Roman k-domination in graphs ⋮ A linear algorithm for double Roman domination of proper interval graphs ⋮ Varieties of Roman Domination ⋮ Independent double Roman domination in graphs ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ Double Roman domination and domatic numbers of graphs ⋮ Properties of double Roman domination on cardinal products of graphs ⋮ Perfect double Roman domination of trees ⋮ Bounds for signed double Roman k-domination in trees ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ Unnamed Item ⋮ Perfect Roman domination 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 of graphs ⋮ Critical concept for double Roman domination in graphs ⋮ Restrained condition on double Roman dominating functions ⋮ The double Roman domination number of generalized Sierpiński graphs ⋮ Double Roman reinforcement number in graphs ⋮ Quadruple Roman domination in graphs ⋮ Isolate Roman domination in graphs ⋮ On computing secure domination of trees
Cites Work
- Unnamed Item
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- The differential and the roman domination number of a graph
- Domination in graphs with minimum degree two
- Extremal Problems for Roman Domination
- Paths, Stars and the Number Three
This page was built for publication: Double Roman domination
