Union of Distance Magic Graphs

• Autorzy: Sylwia Cichacz , Mateusz Nikodem
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

distance magic labeling; magic constant; sigma labeling; graph labeling; union of graphs; lexicographic product; direct product; Kronecker product; Kotzig array

Kategorie tematyczne

• 05C76: Graph operations (line graphs, products, etc.)
• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 1
• Strony: 239-249

Daty

wydano

2017-02-01

otrzymano

2015-07-23

poprawiono

2016-04-11

zaakceptowano

2016-04-11

online

2017-01-13

Twórcy

autor

Sylwia Cichacz

• AGH University of Science and Technology,

autor

Mateusz Nikodem

• AGH University of Science and Technology,

Identyfikatory

DOI

10.7151/dmgt.1932