Constructing distance magic graphs from regular graphs

Dalibor Fronček, Petr Kovář, Tereza Kovářová

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

A graph G with k vertices is distance magic if the vertices can be labeled with numbers 1,2,⋯, k so that the sum of labels of the neighbors of each vertex is equal to the same constant μ0. We present a construction of distance magic graphs arising from arbitrary regular graphs based on an application of magic rectangles. We also solve a problem posed by Shafiq, Ali, and Simanjuntak.

Original languageEnglish (US)
Pages (from-to)349-354
Number of pages6
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume78
StatePublished - Aug 1 2011

Keywords

  • 1-vertex-magic vertex labeling
  • Distance magic labeling
  • Magic rectangles
  • Magic type labeling

Fingerprint Dive into the research topics of 'Constructing distance magic graphs from regular graphs'. Together they form a unique fingerprint.

Cite this