3 problems

Let $P_m$ be the path graph on $m$ vertices and $C_n$ the cycle graph on $n$ vertices, with $m,n\in\mathbb{N}$, $m\geq 2$, and $n\geq 3$. Their Cartesian product $P_m\Box C_n$ is t…

Let $P_{2k+1}$ be the path graph on $2k+1$ vertices and $C_n$ the cycle graph on $n$ vertices. A graph is Non-Distance Magic (NDM) if it admits no bijective labeling…

Cichacz–Froncek conjecture. If $G$ is a distance magic graph, then $G$ is group distance magic.