Union of Distance Magic Graphs
Sylwia Cichacz; Mateusz Nikodem
Discussiones Mathematicae Graph Theory (2017)
- Volume: 37, Issue: 1, page 239-249
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topSylwia Cichacz, and Mateusz Nikodem. "Union of Distance Magic Graphs." Discussiones Mathematicae Graph Theory 37.1 (2017): 239-249. <http://eudml.org/doc/288007>.
@article{SylwiaCichacz2017,
abstract = {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.},
author = {Sylwia Cichacz, Mateusz Nikodem},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {distance magic labeling; magic constant; sigma labeling; graph labeling; union of graphs; lexicographic product; direct product; Kronecker product; Kotzig array},
language = {eng},
number = {1},
pages = {239-249},
title = {Union of Distance Magic Graphs},
url = {http://eudml.org/doc/288007},
volume = {37},
year = {2017},
}
TY - JOUR
AU - Sylwia Cichacz
AU - Mateusz Nikodem
TI - Union of Distance Magic Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 1
SP - 239
EP - 249
AB - 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.
LA - eng
KW - distance magic labeling; magic constant; sigma labeling; graph labeling; union of graphs; lexicographic product; direct product; Kronecker product; Kotzig array
UR - http://eudml.org/doc/288007
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.