Note on group distance magic graphs G[C4]
Abstract
A group distance magic labeling or a -distance magic labeling of a graph G(V,E) with |V | = n is an injection 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+1 for some constant c for any v∈ V(G), then there exists an -distance magic labeling for any Abelian group for the graph G[C4]. Moreover we prove that if is an arbitrary Abelian group of order 4n such that 2 ×2 × for some Abelian group of order n, then exists a -distance magic labeling for any graph G[C4].
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.