Total reinforcement number of a graph

MaRDI QIDQ2474669zbMATH OpenFDO

Authors M. D. Elias, V. S. A. Subramanian, N. 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)

Recommendations

• scientific article; zbMATH DE number 1109413
• scientific article; zbMATH DE number 975422
• scientific article; zbMATH DE number 2188442
• Total restrained reinforcement in graphs
• Total Roman reinforcement in graphs

Cited in

(12)

• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• On the complexity of the bondage and reinforcement problems
• A note on total reinforcement in graphs
• Total k-rainbow reinforcement number in graphs
• Reinforcement number of a graph with respect to half-domination
• Total Roman \(\{2\}\)-reinforcement of graphs
• Total restrained reinforcement in graphs
• 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: Total reinforcement number of a graph

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