Domination parameters with number 2: interrelations and algorithmic consequences

Resumen

In this paper, we study the most basic domination invariants in graphs, in which number $2$ is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak $2$-domination number, $\gamma_{w2}(G)$, the $2$-domination number, $\gamma_2(G)$, the $\lbrace 2\rbrace$-domination number, $\gamma_{\lbrace 2\rbrace}(G)$, the double domination number, $\gamma_{\times 2}(G)$, the total $\lbrace 2\rbrace$-domination number, $\gamma_{t\lbrace 2\rbrace}(G)$, and the total double domination number, $\gamma_{t\times\lbrace 2\rbrace}(G)$, where $G$ is a graph in which the corresponding invariant is well defined. The third criterion yields rainbow versions of the mentioned six parameters, one of which has already been well studied, and three other give new interesting parameters. Together with a special, extensively studied Roman domination, $\gamma_R(G)$, and two classical parameters, the domination number, $\gamma(G)$, and the total domination number, $\gamma_t(G)$, we consider 13 domination invariants in graphs. In the main result of the paper we present sharp upper and lower bounds of each of the invariants in terms of every other invariant, a large majority of which are new results proven in this paper. As a consequence of the main theorem we obtain new complexity results regarding the existence of approximation algorithms for the studied invariants, matched with tight or almost tight inapproximability bounds, which hold even in the class of split graphs.

Publicación
Discrete Applied Mathematics 235 (2018), 23–50