On the complexity of reinforcement in graphs

DOI10.7151/DMGT.1898MaRDI QIDQ339476zbMATHOpenAlexFDO

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

zbMATH Keywords

dominationNP-hardnesstotal dominationreinforcementtotal restrained domination\(k\)-rainbow domination\(p\)-domination

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124610 (Why is no real title available?)
• scientific article; zbMATH DE number 2142620 (Why is no real title available?)
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• A note on total reinforcement in graphs
• Bounds for the 2-domination number of toroidal grid graphs
• Bounds on the 2-rainbow domination number of graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Note on 2-rainbow domination and Roman domination in graphs
• On domination and reinforcement numbers in trees
• On the 2-rainbow domination in graphs
• On the \(p\)-reinforcement and the complexity
• On the complexity of the bondage and reinforcement problems
• On the total restrained domination number of a graph
• On total restrained domination in graphs
• Rainbow domination in graphs
• Some bounds on the \(p\)-domination number in trees
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• Total domination in graphs
• Total reinforcement number of a graph
• Total restrained reinforcement in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(6)

• Rainbow domination in graphs
• Reinforcement number of a graph with respect to half-domination
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• On the \(p\)-reinforcement and the complexity
• The restrained \(k\)-rainbow reinforcement number of graphs

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)