A note on total reinforcement in graphs

DOI10.1016/J.DAM.2011.04.024MaRDI QIDQ642968zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Nader Jafari Rad, Joanna Raczek

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)

Recommendations

• Total restrained reinforcement in graphs
• Total reinforcement number of a graph
• scientific article; zbMATH DE number 975422
• A note on total graphs
• Total Roman reinforcement in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (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 2095763 (Why is no real title available?)
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• On domination and reinforcement numbers in trees
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• Total domination in graphs
• Total reinforcement number of a graph

Cited in

(9)

• Trees with 2-reinforcement number three
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• Trees with maximum \(p\)-reinforcement number
• On the complexity of the bondage and reinforcement problems
• The average lower reinforcement number of a graph
• On the \(p\)-reinforcement and the complexity
• Total Roman reinforcement in graphs
• On the complexity of reinforcement in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642968)