Domination in a digraph and in its reverse

Let image be a digraph. By image we denote the domintaion number of image and by image we denote a digraph obtained by reversing all the arcs of image. In this paper we prove that for every image and image there exists a simple strongly connected image-regular digraph image such that image. Analogous theorem is obtained for total domination number provided that image.