Total restrained reinforcement in graphs

DOI10.1016/J.AKCEJ.2016.02.003zbMath1346.05219OpenAlexW2298795123MaRDI QIDQ322041

Lutz Volkmann, Nader Jafari Rad

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.02.003

zbMATH Keywords

dominationreinforcementtotal restrained domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the complexity of reinforcement in graphs

Cites Work

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

This page was built for publication: Total restrained reinforcement in graphs