Distance Magic Cartesian Products of Graphs
| dc.contributor.author | Elliot Krop | |
| dc.contributor.author | Christopher Raridan | |
| dc.contributor.author | Sylwia Cichacz | |
| dc.contributor.author | Dalibor Froncek | |
| dc.date.accessioned | 2024-05-21T13:41:12Z | |
| dc.date.available | 2024-05-21T13:41:12Z | |
| dc.description.abstract | 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. In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by providing necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12951/1009 | |
| dc.title | Distance Magic Cartesian Products of Graphs | |
| dc.type | Journal Article, Academic Journal | |
| dcterms.bibliographicCitation | Discussiones Mathematicae Graph Theory 36(2), 299-308, (May 2016) |