A note on total reinforcement in graphs

DOI10.1016/j.dam.2011.04.024zbMath1231.05203OpenAlexW2091150736MaRDI QIDQ642968

Nader Jafari Rad, Joanna Raczek, Michael A. Henning

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.024

zbMATH Keywords

dominationtotal dominationreinforcementefficient total domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On the complexity of reinforcement in graphs ⋮ Trees with maximum \(p\)-reinforcement number ⋮ The average lower reinforcement number of a graph ⋮ On the complexity of the bondage and reinforcement problems ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ Total Roman reinforcement in graphs ⋮ Trees with 2-reinforcement number three

Cites Work

• A survey of selected recent results on total domination in graphs
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• On domination and reinforcement numbers in trees
• Total reinforcement number of a graph
• Total domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on total reinforcement in graphs