Double Roman domination
From MaRDI portal
Publication:335328
DOI10.1016/J.DAM.2016.03.017zbMATH Open1348.05146OpenAlexW2346913169MaRDI QIDQ335328FDOQ335328
Authors: 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Extremal problems for roman domination
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- Title not available (Why is that?)
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- The differential and the roman domination number of a graph
Cited In (only showing first 100 items - show all)
- 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
- The Roman domatic problem in graphs and digraphs: a survey
- Title not available (Why is that?)
- On the double Roman domination in graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- On the outer-independent double Italian domination number
- On the outer independent total double Roman domination in graphs
- A Nordhaus–Gaddum bound for Roman domination
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS
- A characterization of double Roman trees
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- On algorithmic complexity of double Roman domination
- Maximal double Roman domination in graphs
- Algorithmic results on double Roman domination in graphs
- On the D-differential of a graph
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
- Signed double Roman domination in graphs
- A new approach on locally checkable problems
- Global triple Roman dominating function
- Algorithm and hardness results in double Roman domination of graphs
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
- Outer independent signed double Roman domination
- Outer independent double Roman domination
- Double Roman domination in digraphs
- Perfect roman domination in regular graphs
- Global double Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- Triple Roman domination in graphs
- Double Roman domination in generalized Petersen graphs
- Total protection of lexicographic product graphs
- The double Roman domatic number of a digraph
- A note on the double Roman domination number of graphs
- Title not available (Why is that?)
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Varieties of Roman domination II
- Outer independent Roman dominating functions in graphs
- An upper bound on the double Roman domination number
- Perfect Italian domination in cographs
- Perfect double Roman domination of trees
- Perfect Roman domination in graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- Varieties of Roman Domination
- Bounds on signed total double Roman domination
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- Some progress on the double Roman domination in graphs
- Perfect Roman domination in trees
- Double Roman domination in trees
- On the total Roman domination in trees
- Complexity of Roman {2}-domination and the double Roman domination in graphs
- Some properties of double Roman domination
- Perfect Italian domination in trees
- Double Roman domination number
- On the global double Roman domination of graphs
- A linear algorithm for double Roman domination of proper interval graphs
- Total double Roman domination in graphs
- Signed double roman domination of graphs
- On the independent double Roman domination in graphs
- Total double Roman domination numbers in digraphs
- Signed total double Roman k-domination in graphs
- Title not available (Why is that?)
- Restrained condition on double Roman dominating functions
- Independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Bounds for signed double Roman k-domination in trees
- On the co-Roman domination in graphs
- On the outer independent double Roman domination number
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Double Roman reinforcement number in graphs
- Double Roman domination subdivision number in graphs
- Further results on the \([k]\)-Roman domination in graphs
- Title not available (Why is that?)
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- On [ k ] -Roman domination in graphs
- Perfect double Italian domination of a graph
- Critical concept for double Roman domination in graphs
- New results on quadruple Roman domination in graphs
- On the total restrained double Italian domination
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Isolate Roman domination in graphs
- On computing secure domination of trees
- Properties of double Roman domination on cardinal products of graphs
- On the double Roman bondage numbers of graphs
- Solving the minimum-cost double Roman domination problem
- Inverse double Roman domination in graphs
- Outer independent double Italian domination: Complexity, characterization
- Complexity aspects of variants of independent Roman domination in graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Unique response Roman domination: complexity and algorithms
- Weak double Roman domination
- Quasi total double Roman domination in graphs
- The \(k\)-th Roman domination problem is polynomial on interval graphs
- Domination parameters of generalized Sierpiński graphs
- Triple Roman domination subdivision number in graphs
- The restrained double Roman domination in graphs
- Lower and upper bounds on independent double Roman domination in trees
This page was built for publication: Double Roman domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335328)
