Note on diagonal construction of -supermagic labeling of

A Γ-supermagic labeling of a graph G(V, E) with (Formula presented.) is a bijection from E to an Abelian group Γ of order k such that the sum of labels of all incident edges of every vertex (Formula presented.) is equal to the same element (Formula presented.) An existence of a (Formula presented.) -supermagic labeling of Cartesian product of two cycles, (Formula presented.) for n odd was proved recently. This along with an earlier result by Ivančo proved the existence of a (Formula presented.) -supermagic labeling of (Formula presented.) for every (Formula presented.) In this paper we present a simple unified labeling method for all (Formula presented.).