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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2017-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1932 |
| _version_ | 1827880367481159680 |
|---|---|
| author | Cichacz Sylwia Nikodem Mateusz |
| author_facet | Cichacz Sylwia Nikodem Mateusz |
| author_sort | Cichacz Sylwia |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T18:20:31Z |
| format | Article |
| id | doaj.art-c80e75c823624df8b542177ca44ae501 |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T18:20:31Z |
| publishDate | 2017-02-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-c80e75c823624df8b542177ca44ae5012023-08-02T08:58:22ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922017-02-0137123924910.7151/dmgt.1932dmgt.1932Union of Distance Magic GraphsCichacz Sylwia0Nikodem Mateusz1AGH University of Science and TechnologyAGH University of Science and TechnologyA 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.https://doi.org/10.7151/dmgt.1932distance magic labelingmagic constantsigma labelinggraph labelingunion of graphslexicographic productdirect productkronecker productkotzig array05c7605c78 |
| spellingShingle | Cichacz Sylwia Nikodem Mateusz Union of Distance Magic Graphs Discussiones Mathematicae Graph Theory distance magic labeling magic constant sigma labeling graph labeling union of graphs lexicographic product direct product kronecker product kotzig array 05c76 05c78 |
| title | Union of Distance Magic Graphs |
| title_full | Union of Distance Magic Graphs |
| title_fullStr | Union of Distance Magic Graphs |
| title_full_unstemmed | Union of Distance Magic Graphs |
| title_short | Union of Distance Magic Graphs |
| title_sort | union of distance magic graphs |
| topic | distance magic labeling magic constant sigma labeling graph labeling union of graphs lexicographic product direct product kronecker product kotzig array 05c76 05c78 |
| url | https://doi.org/10.7151/dmgt.1932 |
| work_keys_str_mv | AT cichaczsylwia unionofdistancemagicgraphs AT nikodemmateusz unionofdistancemagicgraphs |