2017
DOI: 10.7151/dmgt.1932
|View full text |Cite
|
Sign up to set email alerts
|

Union of distance magic graphs

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Kotzig arrays play an important role for graph labelings. There are many constructions based on Kotzig arrays of various magic-type constructions [3,4,9,13,14,16].…”
Section: A γ-Magic Rectangle Set Mrs γ (A B; C)mentioning
confidence: 99%
“…Kotzig arrays play an important role for graph labelings. There are many constructions based on Kotzig arrays of various magic-type constructions [3,4,9,13,14,16].…”
Section: A γ-Magic Rectangle Set Mrs γ (A B; C)mentioning
confidence: 99%