On the \(p\)-reinforcement and the complexity

DOI10.1007/s10878-013-9597-9zbMath1338.90429arXiv1204.4013MaRDI QIDQ2253958

Fu-Tao Hu, You Lu, Jun-Ming Xu

Publication date: 16 February 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4013

zbMATH Keywords

NP-hard; domination; \(p\)-domination; \(p\)-reinforcement

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

On the complexity of the outer-connected bondage and the outer-connected reinforcement problems, Trees with 2-reinforcement number three, On the complexity of reinforcement in graphs, The average lower reinforcement number of a graph

Cites Work

• On the complexity of the bondage and reinforcement problems
• A note on total reinforcement in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on the k-domination number of a graph
• Reinforcement numbers of digraphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• On domination and reinforcement numbers in trees
• Total reinforcement number of a graph
• Some bounds on the \(p\)-domination number in trees
• Theory and Application of Graphs
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item