Vertex-addition strategy for domination-like invariants (Q2401431)

Summary: \textit{W. McCuaig} and \textit{B. Shepherd} [J. Graph Theory 13, No. 6, 749--762 (1989; Zbl 0708.05058)], gave an upper bound of the domination number for connected graphs with minimum degree at least two. In this paper, we propose a simple strategy which, together with the McCuaig-Shepherd theorem, gives a sharp upper bound of the domination number via the number of leaves. We also apply the same strategy to other domination-like invariants, and find a relationship between such invariants and the number of leaves.