Note on group distance magic graphs G[C4]G[C_4]

preprint2012arXivOpen access

Abstract

A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph G(V,E)G(V,E) with ∣V∣=n|V | = n is an injection ff from VV to an Abelian group $\gr$ of order nn such that the weight w(x)=∑y∈NG(x)f(y)w(x)=\sum_{y\in N_G(x)}f(y) of every vertex x∈Vx \in V is equal to the same element $μ\in \gr$, called the magic constant. In this paper we will show that if GG is a graph of order n=2p(2k+1)n=2^{p}(2k+1) for some natural numbers pp, kk such that $°(v)\equiv c \imod {2^{p+1}}$ for some constant cc for any v∈V(G)v\in V(G), then there exists an $\gr$-distance magic labeling for any Abelian group $\gr$ for the graph G[C4]G[C_4]. Moreover we prove that if $\gr$ is an arbitrary Abelian group of order 4n4n such that $\gr \cong \zet_2 \times\zet_2 \times \gA$ for some Abelian group $\gA$ of order nn, then exists a $\gr$-distance magic labeling for any graph G[C4]G[C_4].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.