Total Reinforcement Number of a Graph
N. S. Sridharan, M. Cardoso Elias, V.S.A. Subramanian · AKCE International Journal of Graphs and Combinatorics · 2020
A set D of vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total domination number γt(G) is the minimum cardinalit...