domination number; numerical invariants; signed domination number; minus domination number
The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $\g_s (G)$ and the minus domination number $\g^-(G)$. These numerical invariants are compared for graphs in which the degrees of vertices do not exceed 3.
 J. E. Dunbar S. T. Hedetniemi M. A. Henning P. J. Slater: Signed domination in graphs. Proc. Seventh Int. Conf. Graph Theory, Combinatorics, Algorithms and Applications. To appear.
 J. E. Dunbar S. T. Hedetniemi M. A. Henning A. A. McRae: Minus domination in graphs. Discr. Math.. To appear.