Distance magic graphs G C_n

Publication date 8 September 2014

Abstract: A

G a m m a

-distance magic labeling of a graph

G = (V, E)

with

| V | = n

is a bijection

f

from

V

to an Abelian group

G a m m a

of order

n

such that the weight

w (x) = s u m_{y i n N_{G} (x)} f (y)

of every vertex

x i n V

is equal to the same element

m u i n G a m m a

, called the emph{magic constant}. In this paper we will show that if

G

is a graph of order

n = 2^{p} (2 k + 1)

for some natural numbers

p

,

k

such that

d e g (v) e q u i v c i m o d 2^{p + 2}

for some constant

c

for any

v i n V (G)

, then there exists a

G a m m a

-distance magic labeling for any Abelian group

G a m m a

of order

4 n

for the direct product

G i m e s C_{4}

. Moreover if

c

is even then there exists a

G a m m a

-distance magic labeling for any Abelian group

G a m m a

of order

8 n

for the direct product

G i m e s C_{8}

.

Recommendations

Cites work

Cited in

(18)

This page was built for publication: Distance magic graphs \(G \times C_n\)