Distance Magic Cartesian Products of Graphs
No Thumbnail Available
Authors
Elliot Krop
Christopher Raridan
Sylwia Cichacz
Dalibor Froncek
Issue Date
Type
Journal Article, Academic Journal
Language
Keywords
Alternative Title
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.
In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by providing necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.