Wheel-supermagic labelings for a wheel \(k\)-multilevel corona with a cycle (Q2443447)

For graphs \(G\) and \(H\), the \(k\)-multilevel corona operation \(G \odot^k H\) is recursively defined to be \((G \odot^{k-1} H) \odot H\), \(k \geq 2\), and \(G \odot H\) for \(k=1\), where \(G \odot H\) is obtained from \(G\) and \(|V(G)|\) copies of \(H\) so that the \(i\)th vertex of \(G\) is joined to all vertices of the \(i\)th copy of \(H\). A graph \(G\) is said to be \(H\)-magic if every edge of \(G\) belongs to at least one subgraph isomorphic to \(H\) and there is a total labeling \(f : V(G) \cup V(H) \to \{1,2, \dots , |V(G)|+|V(H)|\}\) such that, for each subgraph \(H^\prime\) of \(G\) isomorphic to \(H\), the sum of all vertex lables in \(V(H^\prime)\) plus the sum of all edge labels in \(E(H^\prime)\) is a constant. If \(f(V(G)) = \{1,2, \dots , |V(G)|\}\), then \(G\) is called \(H\)-supermagic. The authors prove in this paper that the \(k\)-multilevel corona operation of a wheel \(W_n\) and a cycle \(C_n\) is \(W_n\)-supermagic.