We prove a lower bound for the minus-domination number of r-regular multigraphs, using a probabilistic argument.
