Algorithmic aspects of total Roman and total double Roman domination in graphs
From MaRDI portal
Publication:831689
DOI10.1007/978-3-030-67899-9_3OpenAlexW3127008891MaRDI QIDQ831689
Venkata Subba Reddy Palagiri, Chakradhar Padamutham
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Double Roman domination
- Roman domination on strongly chordal graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Efficient algorithms for Roman domination on some classes of graphs
- On the Roman domination number of a graph
- Optimization, approximation, and complexity classes
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Some APX-completeness results for cubic graphs
- Signed double Roman domination in graphs
- Double Roman domination number
- Defending the Roman Empire---a new strategy
- Threshold graphs and related topics
- Algorithmic aspects of Roman domination in graphs
- Outer independent double Roman domination
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- On the double Roman domination in graphs
- Total Roman domination in the lexicographic product of graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Triple Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A characterization of Roman trees
- Total Domination in Graphs
- Complexity of Roman {2}-domination and the double Roman domination in graphs
- Total double Roman domination in graphs
- Total Roman domination in graphs
- Node-and edge-deletion NP-complete problems
- Algorithms and Computation
This page was built for publication: Algorithmic aspects of total Roman and total double Roman domination in graphs
