On the complexity of reinforcement in graphs
DOI10.7151/DMGT.1898zbMATH Open1350.05126OpenAlexW2530676543MaRDI QIDQ339476FDOQ339476
Authors: Nader Jafari Rad 
Publication date: 11 November 2016
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1898
dominationNP-hardnesstotal dominationreinforcementtotal restrained domination\(k\)-rainbow domination\(p\)-domination
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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?)
- On the \(p\)-reinforcement and the complexity
- On the 2-rainbow domination in graphs
- On domination and reinforcement numbers in trees
- Some bounds on the \(p\)-domination number in trees
- Bounds on the 2-rainbow domination number of graphs
- Title not available (Why is that?)
- On the complexity of the bondage and reinforcement problems
- Title not available (Why is that?)
- Total Domination in Graphs
- Title not available (Why is that?)
- A note on total reinforcement in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- On the total restrained domination number of a graph
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- Total restrained reinforcement in graphs
- Bounds for the 2-domination number of toroidal grid graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Total reinforcement number of a graph
- On total restrained domination in graphs
- Title not available (Why is that?)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
Cited In (6)
- Title not available (Why is that?)
- Rainbow Domination in Graphs
- Reinforcement number of a graph with respect to half-domination
- On the \(p\)-reinforcement and the complexity
- The restrained k-rainbow reinforcement number of graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication: On the complexity of reinforcement in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339476)
