A note on total reinforcement in graphs

DOI10.1016/J.DAM.2011.04.024zbMATH Open1231.05203OpenAlexW2091150736MaRDI QIDQ642968FDOQ642968

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

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

zbMATH Keywords

dominationtotal dominationreinforcementefficient total domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On domination and reinforcement numbers in trees
• Total domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of selected recent results on total domination in graphs
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• Title not available (Why is that?)
• Total reinforcement number of a graph
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• Trees with 2-reinforcement number three
• 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)