Distance Magic Cartesian Products of Graphs
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Main Authors: | Cichacz Sylwia, Froncek Dalibor, Krop Elliot, Raridan Christopher |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1852 |
Similar Items
-
Some distance magic graphs
by: Aloysius Godinho, et al.
Published: (2018-04-01) -
Union of Distance Magic Graphs
by: Cichacz Sylwia, et al.
Published: (2017-02-01) -
Distance antimagic labelings of Cartesian product of graphs
by: Nancy Jaseintha Cutinho, et al.
Published: (2020-09-01) -
The Distance Magic Index of a Graph
by: Godinho Aloysius, et al.
Published: (2018-02-01) -
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles
by: Bryan Freyberg, et al.
Published: (2017-10-01)