Domination Parameters of Graph Covers

A graph $G$ is a \emph{cover} of a graph $F$ if there exists an onto mapping $π: V(G) \to V(F)$, called a (\emph{covering}) \emph{projection}, such that $π$ maps the neighbours of any vertex $v$ in $G$ bijectively onto the neighbours of $π(v)$ in $F$. This paper is the first attempt to study the con