Union of Distance Magic Graphs

Union of Distance Magic Graphs

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as...

Full description

Bibliographic Details
Main Authors: Cichacz Sylwia, Nikodem Mateusz
Format: Article
Language:English
Published: Sciendo 2017-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
distance magic labeling
magic constant
sigma labeling
graph labeling
union of graphs
lexicographic product
direct product
kronecker product
kotzig array
05c76
05c78
Online Access:https://doi.org/10.7151/dmgt.1932
Description
Summary:A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
ISSN:2083-5892

Similar Items