pith. sign in

arxiv: 1302.6561 · v1 · pith:4YSLCFZBnew · submitted 2013-02-26 · 🧮 math.CO

Group distance magic graphs Gtimes C_n

classification 🧮 math.CO
keywords gammamagicdistancegrouporderabelianlabelingtimes
0
0 comments X
read the original abstract

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same element $\mu \in \Gamma$, called the \emph{magic constant}. In this paper we will show that if $G$ is a graph of order $n=2^{p}(2k+1)$ for some natural numbers $p$, $k$ such that $\deg(v)\equiv c \imod {2^{p+2}}$ for some constant $c$ for any $v\in V(G)$, then there exists a $\Gamma$-distance magic labeling for any Abelian group $\Gamma$ of order $4n$ for the direct product $G\times C_4$. Moreover if $c$ is even then there exists a $\Gamma$-distance magic labeling for any Abelian group $\Gamma$ of order $8n$ for the direct product $G\times C_8$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.