Complexity issues concerning the quadruple Roman domination problem in graphs
From MaRDI portal
Recommendations
- Algorithmic complexity of triple Roman dominating functions on graphs
- Quadruple Roman domination in graphs
- Algorithmic aspects of Roman domination in graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
Cites work
- A mixed integer linear programming formulation for restrained Roman domination problem
- Approximation hardness of dominating set problems in bounded degree graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Domination games played on graphs
- From domination to coloring. Stephen Hedetniemi's graph theory and beyond
- Further results on the \([k]\)-Roman domination in graphs
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Integer linear programming formulations for double Roman domination problem
- Introduction to algorithms
- Linear programming approach for various domination parameters
- Linear programming formulation for some generalized domination parameters
- Perfect codes in graphs
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Some APX-completeness results for cubic graphs
- Threshold graphs and related topics
- Total domination in graphs
- Triple Roman domination in graphs
- Varieties of Roman Domination
- Varieties of Roman domination. II
This page was built for publication: Complexity issues concerning the quadruple Roman domination problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658307)
