Abstract

A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ 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 \gr$, called the 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+1}}$ for some constant $c$ for any $v\in V(G)$, then there exists an $\gr$-distance magic labeling for any Abelian group $\gr$ for the graph $G[C_4]$. Moreover we prove that if $\gr$ is an arbitrary Abelian group of order $4n$ such that $\gr \cong \zet_2 \times\zet_2 \times \gA$ for some Abelian group $\gA$ of order $n$, then exists a $\gr$-distance magic labeling for any graph $G[C_4]$.

Highlights

  • All graphs considered in this paper are simple finite graphs

  • Definition 18 A group distance magic labeling or a G-distance magic labeling of a graph G = (V, E) with |V | = n is a bijection f from V to an Abelian group G 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 μ ∈ G, called the magic constant

  • In this paper we will prove that if G is a graph of order n = 2p(2k + 1) for some natural numbers p, k such that deg(v) ≡ c for some constant c for any v ∈ V (G), there exists a G-distance magic labeling for any Abelian group G of order 4n for the graph G[C4]

Read more

Summary

Introduction

Consider a simple graph G whose order we denote by |G| = n. The neighborhood N (x) of a vertex x is the set of vertices adjacent to x, and the degree deg(x) of x is |N (x)|, the size of the neighborhood of x. A distance magic labeling ( called sigma labeling) of a graph G = (V, E) of order n is a bijection l : V → {1, 2, . The sum y∈NG(x) l(y) is called the weight of the vertex x and denoted by w(x). The following observations were independently proved: Observation 11 [10,11,12,14] Let G be an r -regular distance magic graph on n vertices

Then μ
Abelian group
Suppose first that G
For j
Since azi
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call