  The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex
set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g^{\prime},h^{\prime})$ of
$G\diamond H$ are adjacent if $g=g^{\prime}$ and $hh^{\prime}\in E(H)$, or
$gg^{\prime}\in E(G)$ and $h=h^{\prime}$, or $gg^{\prime}\in E(G)$ and
$hh^{\prime}\in E(H)$, or (for $g\neq g^{\prime}$ and $h\neq h^{\prime}$)
$gg^{\prime}\notin E(G)$ and $hh^{\prime}\notin E(H)$. A set $D\subseteq V(G)$
is a dominating set of $G$ if every vertex outside of $D$ contains a neighbor
in $D$. A set $D\subseteq V(G)$ is a total dominating set of $G$ if every
vertex of $G$ contains a neighbor in $D$. The domination number $\gamma(G)$
(resp. total domination number $\gamma_{t}(G)$) of $G$ is the minimum
cardinality of a dominating set (resp. total dominating set) of $G$. In this
work we give several upper and lower bounds for $\gamma(G\diamond H)$ in terms
of $\gamma(G),$ $\gamma(H)$, $\gamma_{t}(\overline{G})$ and $\gamma
_{t}(\overline{H})$, where $\overline{G}$ is the complement graph of $G$.
Further, we fully describe graphs where $\gamma(G\diamond H)=k$ for
$k\in\{1,2,3\}$. Several conditions on $G$ and $H$ under which $\gamma
(G\diamond H)$ is at most $4$ and $5$ are also given. A new type of
simultaneous domination $\bar{\gamma}(G)$, defined as the smallest number of
vertices that dominates $G$ and totally dominates the complement of $G,$
emerged as useful and we believe it could be of independent interest. We
conclude the paper by proposing few directions for possible further research.
