Abstract
A group distance magic labeling of a graph G(V,E) with {pipe}V {pipe} = n is an injection from V to an abelian group Γ of order n such that the sum of labels of all neighbors of every vertex x ∈ V is equal to the same element μ ∈ Γ. We completely characterize all Cartesian products Ck Cm that admit a group distance magic labeling by Zkm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 167-174 |
| Number of pages | 8 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 55 |
| State | Published - Mar 25 2013 |