Distance magic circulant graphs

Sylwia Cichacz, Dalibor Froncek

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

Let G=(V,E) be a graph of order n. A distance magic labeling of G is a bijection ℓ:V → {1,2,...,n} for which there exists a positive integer k such that Σx∈N(v) ℓ(x)=k for all v ∈ V, where N(v) is the neighborhood of v. In this paper we deal with circulant graphs Cn(1,p). The circulant graph Cn(1,p) is the graph on the vertex set V={x0,x1,...,xn-1} with edges (xi,xi+p) for i=0,...,n-1 where i+p is taken modulo n. We completely characterize distance magic graphs Cn(1,p) for p odd. We also give some sufficient conditions for p even. Moreover, we also consider a group distance magic labeling of Cn(1,p).

Original languageEnglish (US)
Pages (from-to)84-94
Number of pages11
JournalDiscrete Mathematics
Volume339
Issue number1
DOIs
StatePublished - Jan 6 2016

Bibliographical note

Funding Information:
The author was supported by the National Science Centre Grant No. 2011/01/D/ST1/04104 .

Publisher Copyright:
© 2015 Elsevier B.V.

Keywords

  • Circulant graphs
  • Distance magic labeling
  • Group distance magic labeling

Fingerprint

Dive into the research topics of 'Distance magic circulant graphs'. Together they form a unique fingerprint.

Cite this