1 problem

Let $G=(V,E)$ be a connected graph of size $m$. A labeling of its edges by $\{1,2,\dots,m\}$ is product antimagic if the products of the labels incident with the vertices are pairw…