Distance magic cartesian products of graphs

Sylwia Cichacz; Dalibor Froncek; Elliot Ivrop; Christopher Raridand

doi:10.7151/dmgt.1852

Distance magic cartesian products of graphs

Sylwia Cichacz, Dalibor Froncek, Elliot Ivrop, Christopher Raridand

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

A distance magic labeling of a graph G = (V,E) with |V| = n is a bijection l: 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 proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.

Original language	English (US)
Pages (from-to)	299-308
Number of pages	10
Journal	Discussiones Mathematicae - Graph Theory
Volume	36
Issue number	2
DOIs	https://doi.org/10.7151/dmgt.1852
State	Published - 2016

Bibliographical note

Funding Information:
Supported by National Science Centre Grant No. 2011/01/D/ST1/04104.

Keywords

Cartesian product
Complete multipartite graph
Cycle
Distance magic labeling
Hypercube
Magic constant
Sigma labeling

Publisher link

10.7151/dmgt.1852

Find It

Find It at U of M Libraries

Cite this

@article{323d0aa6572a482190021be8bcd342c9,

title = "Distance magic cartesian products of graphs",

abstract = "A distance magic labeling of a graph G = (V,E) with |V| = n is a bijection l: 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 proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.",

keywords = "Cartesian product, Complete multipartite graph, Cycle, Distance magic labeling, Hypercube, Magic constant, Sigma labeling",

author = "Sylwia Cichacz and Dalibor Froncek and Elliot Ivrop and Christopher Raridand",

note = "Funding Information: Supported by National Science Centre Grant No. 2011/01/D/ST1/04104.",

year = "2016",

doi = "10.7151/dmgt.1852",

language = "English (US)",

volume = "36",

pages = "299--308",

journal = "Discussiones Mathematicae - Graph Theory",

issn = "1234-3099",

publisher = "University of Zielona Gora",

number = "2",

}

TY - JOUR

T1 - Distance magic cartesian products of graphs

AU - Cichacz, Sylwia

AU - Froncek, Dalibor

AU - Ivrop, Elliot

AU - Raridand, Christopher

N1 - Funding Information: Supported by National Science Centre Grant No. 2011/01/D/ST1/04104.

PY - 2016

Y1 - 2016

N2 - A distance magic labeling of a graph G = (V,E) with |V| = n is a bijection l: 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 proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.

AB - A distance magic labeling of a graph G = (V,E) with |V| = n is a bijection l: 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 proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.

KW - Cartesian product

KW - Complete multipartite graph

KW - Cycle

KW - Distance magic labeling

KW - Hypercube

KW - Magic constant

KW - Sigma labeling

UR - http://www.scopus.com/inward/record.url?scp=84962878602&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962878602&partnerID=8YFLogxK

U2 - 10.7151/dmgt.1852

DO - 10.7151/dmgt.1852

M3 - Article

AN - SCOPUS:84962878602

SN - 1234-3099

VL - 36

SP - 299

EP - 308

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

IS - 2

ER -

Distance magic cartesian products of graphs

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this