Algorithmic aspects of total Roman and total double Roman domination in graphs
From MaRDI portal
(Redirected from Publication:831689)
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 6815662 (Why is no real title available?)
- A characterization of Roman trees
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Algorithmic aspects of Roman domination in graphs
- Algorithms and Computation
- Approximation hardness of dominating set problems in bounded degree graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire from multiple attacks
- Defending the Roman Empire---a new strategy
- Double Roman domination
- Double Roman domination number
- Efficient algorithms for Roman domination on some classes of graphs
- Node-and edge-deletion NP-complete problems
- On the Roman domination number of a graph
- On the double Roman domination in graphs
- Optimization, approximation, and complexity classes
- Outer independent double Roman domination
- Roman domination in graphs.
- Roman domination on strongly chordal graphs
- Roman domination perfect graphs
- Signed double Roman domination in graphs
- Some APX-completeness results for cubic graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Threshold graphs and related topics
- Total Roman domination in the lexicographic product of graphs
- Total domination in graphs
- Total double Roman domination in graphs
- Total roman domination in graphs
- Triple Roman domination in graphs
Cited in
(2)
This page was built for publication: Algorithmic aspects of total Roman and total double Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831689)
