Triple Roman domination in graphs
From MaRDI portal
Publication:2661014
Recommendations
Cites work
- 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
- Defending the Roman Empire---a new strategy
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in trees
- Double Roman trees.
- Efficient algorithms for Roman domination on some classes of graphs
- scientific article; zbMATH DE number 6769213 (Why is no real title available?)
- Integer linear programming formulations for double Roman domination problem
- Italian domination in trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- Mixed Roman domination in graphs
- Outer independent double Roman domination
- Properties of independent Roman domination in graphs
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Signed double Roman domination in graphs
- Signed double roman domination of graphs
- Total double Roman domination in graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
Cited in
(46)- Defending the Roman Empire from multiple attacks
- Total Roman \(\{2\}\)-reinforcement of graphs
- The domination number of round digraphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- A new approach on locally checkable problems
- Global triple Roman dominating function
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- The signed edge-domatic number of nearly cubic graphs
- Maximal double Roman domination in graphs
- On the strong Roman domination number of graphs
- Roman domination in graphs
- On 3-Roman domination in graphs
- Properties of double Roman domination on cardinal products of graphs
- scientific article; zbMATH DE number 7366787 (Why is no real title available?)
- Total vertex-edge domination in trees
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Total double Roman domination numbers in digraphs
- Double Roman reinforcement number in graphs
- Quadruple Roman domination in graphs
- Double Roman domination subdivision number in graphs
- Triple Roman domination subdivision number in graphs
- On [k]-Roman domination subdivision number of graphs
- An upper bound on triple Roman domination
- Algorithmic complexity of triple Roman dominating functions on graphs
- On [ k ] -Roman domination in graphs
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Roman domination in signed graphs
- New results on quadruple Roman domination in graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Further results on the \([k]\)-Roman domination in graphs
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two
- The k-th Roman domination problem is polynomial on interval graphs
- A characterization of graphs with global 3-rainbow domination number equal to the number of vertices
- Complexity issues concerning the quadruple Roman domination problem in graphs
- Independent \([k]\)-Roman domination on graphs
- More results on the outer-independent triple Roman domination number
- Perfect triple Roman domination
- The triple Roman domination stability in graphs
- Some results on the global triple Roman domination in graphs
- On double Roman domination problem for several graph classes
- Further results on outer independent triple Roman domination
- Outer-independent triple Roman domination
- Bounds for (strong) Roman k-dominations
- Roman domination problem with uncertain positioning and deployment costs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
This page was built for publication: Triple Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661014)
