Total reinforcement number of a graph

zbMath1136.05052MaRDI QIDQ2474669

V. S. A. Subramanian, M. D. Elias, N. S. Sridharan

Publication date: 6 March 2008

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

zbMATH Keywords

total domination numbertotal reinforcement number

Mathematics Subject Classification ID

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

Related Items (10)

On the complexity of reinforcement in graphs ⋮ The average lower reinforcement number of a graph ⋮ On the complexity of the bondage and reinforcement problems ⋮ A note on total reinforcement in graphs ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Reinforcement number of a graph with respect to half-domination ⋮ Total Roman reinforcement in graphs ⋮ Total k-rainbow reinforcement number in graphs

This page was built for publication: Total reinforcement number of a graph