1 problem

A cycle $C_n$ is a graph with $n$ vertices and $n$ edges, and a graph is perfect edge-magic if it admits an edge-magic labeling whose induced edge sums attain every possible valenc…