Convex and weakly convex domination in prism graphs

Monika Rosicka

For a given graph $G=(V,E)$ and permutation $\pi :V\mapsto V$ the prism $\pi G$ of $G$ is defined as follows: $V(\pi G)=V(G)\cup V(G^{\prime })$, where $G^{\prime }$ is a copy of $G$, and $E(πG)=E(G)\cup E(G…