Total 2-rainbow domination in graphs: complexity and algorithms
DOI10.1142/s0129054123500260MaRDI QIDQ6629672
Manjay Kumar, P. Venkata Subba Reddy
Publication date: 30 October 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
approximation algorithmNP-completenessinteger linear programmingdominationgraph classesAPX-completenesstotal 2-rainbow domination
Integer programming (90C10) Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the 2-rainbow domination number of graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Counting independent sets in tree convex bipartite graphs
- On \(k\)-rainbow domination in regular graphs
- Rainbow domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- Note on 2-rainbow domination and Roman domination in graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Optimization, approximation, and complexity classes
- Roman domination in graphs.
- Some APX-completeness results for cubic graphs
- Algorithmic aspects of semitotal domination in graphs
- Graphs with large total 2-rainbow domination number
- Threshold graphs and related topics
- Total 2-rainbow domination numbers of trees
- On the 2-rainbow domination in 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
- Graph Classes: A Survey
- Total $k$-Rainbow domination numbers in graphs
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- Node-and edge-deletion NP-complete problems
- Algorithms and Computation
This page was built for publication: Total 2-rainbow domination in graphs: complexity and algorithms
