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: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1852 |
id |
doaj-e8799f7e78f045118123d0698de13311 |
---|---|
record_format |
Article |
spelling |
doaj-e8799f7e78f045118123d0698de133112021-09-05T17:20:21ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922016-05-0136229930810.7151/dmgt.1852dmgt.1852Distance Magic Cartesian Products of GraphsCichacz Sylwia0Froncek Dalibor1Krop Elliot2Raridan Christopher3AGH University of Science and TechnologyKraków, PolandDepartment of Mathematics and Statistics University of Minnesota-Duluth, USADepartment of Mathematics, Clayton State University, USADepartment of Mathematics, Clayton State University, USAA 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.https://doi.org/10.7151/dmgt.1852distance magic labelingmagic constantsigma labelingcartesian producthypercubecomplete multipartite graphcycle |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Cichacz Sylwia Froncek Dalibor Krop Elliot Raridan Christopher |
spellingShingle |
Cichacz Sylwia Froncek Dalibor Krop Elliot Raridan Christopher Distance Magic Cartesian Products of Graphs Discussiones Mathematicae Graph Theory distance magic labeling magic constant sigma labeling cartesian product hypercube complete multipartite graph cycle |
author_facet |
Cichacz Sylwia Froncek Dalibor Krop Elliot Raridan Christopher |
author_sort |
Cichacz Sylwia |
title |
Distance Magic Cartesian Products of Graphs |
title_short |
Distance Magic Cartesian Products of Graphs |
title_full |
Distance Magic Cartesian Products of Graphs |
title_fullStr |
Distance Magic Cartesian Products of Graphs |
title_full_unstemmed |
Distance Magic Cartesian Products of Graphs |
title_sort |
distance magic cartesian products of graphs |
publisher |
Sciendo |
series |
Discussiones Mathematicae Graph Theory |
issn |
2083-5892 |
publishDate |
2016-05-01 |
description |
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. |
topic |
distance magic labeling magic constant sigma labeling cartesian product hypercube complete multipartite graph cycle |
url |
https://doi.org/10.7151/dmgt.1852 |
work_keys_str_mv |
AT cichaczsylwia distancemagiccartesianproductsofgraphs AT froncekdalibor distancemagiccartesianproductsofgraphs AT kropelliot distancemagiccartesianproductsofgraphs AT raridanchristopher distancemagiccartesianproductsofgraphs |
_version_ |
1717786549141110784 |