Algorithmic aspects of total Roman ${2}$-domination in graphs
From MaRDI portal
Publication:6101489
DOI10.22049/cco.2021.27063.1189zbMath1524.05211OpenAlexW3178084733MaRDI QIDQ6101489
No author found.
Publication date: 1 June 2023
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14264.html
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Approximation algorithm for (connected) Italian dominating function ⋮ New results on quadruple Roman domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Algorithmic aspects of semitotal domination in graphs
- Threshold graphs and related topics
- Total Roman \(\{2\}\)-dominating functions in graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Total Domination in Graphs
- Complexity of Roman {2}-domination and the double Roman domination in graphs
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
- Node-and edge-deletion NP-complete problems
- Algorithms and Computation
This page was built for publication: Algorithmic aspects of total Roman ${2}$-domination in graphs
