1 problem

A graph $G$ is super edge-magic if it admits an edge-magic labeling whose vertex labels are exactly $\{1,2,\ldots,|V(G)|\}$. A tree is nontrivial if it has at least one edge. Enomo…