Total 2-rainbow domination in graphs: complexity and algorithms
DOI10.1142/S0129054123500260MaRDI QIDQ6629672FDOQ6629672
Authors: 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 algorithminteger linear programmingNP-completenessdominationgraph classesAPX-completenesstotal 2-rainbow domination
Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Graph Classes: A Survey
- Roman domination in graphs.
- Threshold graphs and related topics
- On the 2-rainbow domination in graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On 2-rainbow domination and roman domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Algorithms and Computation
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- Node-and edge-deletion NP-complete problems
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Rainbow domination on trees
- Approximation hardness of dominating set problems in bounded degree graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Total $k$-Rainbow domination numbers in graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Counting independent sets in tree convex bipartite graphs
- On \(k\)-rainbow domination in regular graphs
- Algorithmic aspects of semitotal domination in graphs
- Graphs with large total 2-rainbow domination number
- Total 2-rainbow domination numbers of trees
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
This page was built for publication: Total 2-rainbow domination in graphs: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629672)
