Complexity issues concerning the quadruple Roman domination problem in graphs
From MaRDI portal
Publication:6658307
DOI10.1016/J.TCS.2024.115013MaRDI QIDQ6658307
Venkata Subba Reddy Palagiri, Guru Pratap Sharma, Ismael G. Yero
Publication date: 8 January 2025
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman \(\{2 \}\)-domination
- Approximation hardness of dominating set problems in bounded degree graphs
- Roman domination in graphs.
- Some APX-completeness results for cubic graphs
- Threshold graphs and related topics
- Perfect codes in graphs
- Triple Roman domination in graphs
- Introduction to algorithms
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Varieties of Roman Domination
- Total Domination in Graphs
- Varieties of Roman domination II
- Linear programming formulation for some generalized domination parameters
- Integer linear programming formulations for double roman domination problem
- From Domination to Coloring
- Domination Games Played on Graphs
- Linear programming approach for various domination parameters
- Further results on the \([k]\)-Roman domination in graphs
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)
