Group distance magic graphs G× Cn
Abstract
A -distance magic labeling of a graph G=(V,E) with |V | = n is a bijection f from V to an Abelian group of order n such that the weight w(x)=Σy∈ NG(x)f(y) of every vertex x ∈ V is equal to the same element μ ∈ , called the magic constant. In this paper we will show that if G is a graph of order n=2p(2k+1) for some natural numbers p, k such that (v) c 2p+2 for some constant c for any v∈ V(G), then there exists a -distance magic labeling for any Abelian group of order 4n for the direct product G× C4. Moreover if c is even then there exists a -distance magic labeling for any Abelian group of order 8n for the direct product G× C8.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.