The place of super edge-magic labelings among other classes of labelings (Q5937585)

An edge-magic labeling of a graph \(G\) with \(n\) vertices and \(m\) edges is a bijective function \(f\colon V(G)\cup E(G)\to\{1,2,\dots,m+n\}\) such that \(f(u)+f(v)+f(uv)=k\) is a constant for any edge \(uv\) of \(G\). An edge-magic labeling of \(G\) is said to be a super edge-magic labeling if \(f(V(G))=\{1,2,\dots,n\}\). If there is a super edge-magic labeling of \(G\) then \(G\) is said to be super edge-magic. Several necessary conditions for a graph to be super edge-magic are established in this paper. The authors also introduce some classes of super edge-magic graphs. For example, they prove that the generalized prism \(C_m\times P_n \) is super edge-magic if \(m\) is odd and \(n\geq 2\). Then relations between super edge-magic and other known types of labelings (sequential labeling, harmonious labeling, cordial labeling and graceful labeling) are presented. Finally, a closed formula for the number of distinct super edge-magic labelings of \((p,q)\)-graphs is obtained.