On domination and reinforcement numbers in trees

DOI10.1016/j.disc.2007.03.067zbMath1133.05065OpenAlexW1976227376MaRDI QIDQ2469996

Patrick Jones, Steve Horton, Stephen T. Hedetniemi, Jean R. S. Blair, Wayne Goddard, Grzegorz M. Kubicki

Publication date: 11 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.067

zbMATH Keywords

treesdominationreinforcement

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total restrained reinforcement in graphs ⋮ On the complexity of reinforcement in graphs ⋮ Trees with maximum \(p\)-reinforcement number ⋮ The average lower reinforcement number of a graph ⋮ A note on total reinforcement in graphs ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ The restrained k-rainbow reinforcement number of graphs ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Trees with 2-reinforcement number three

Cites Work

• On graphs having domination number half their order
• The distance-domination numbers of trees
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• The Maximum Coverage Location Problem
• Domination-balanced graphs
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item