Distance Magic Cartesian Products of Graphs

Abstract

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.

Keywords

• distance magic labeling
• magic constant
• sigma labeling
• cartesian product
• hypercube
• complete multipartite graph
• cycle