Note on diagonal construction of -supermagic labeling of

Dalibor Froncek, Michael McKeown

Research output: Contribution to journalArticlepeer-review

Abstract

A Γ-supermagic labeling of a graph G(V, E) with (Formula presented.) is a bijection from E to an Abelian group Γ of order k such that the sum of labels of all incident edges of every vertex (Formula presented.) is equal to the same element (Formula presented.) An existence of a (Formula presented.) -supermagic labeling of Cartesian product of two cycles, (Formula presented.) for n odd was proved recently. This along with an earlier result by Ivančo proved the existence of a (Formula presented.) -supermagic labeling of (Formula presented.) for every (Formula presented.) In this paper we present a simple unified labeling method for all (Formula presented.).

Original languageEnglish (US)
Pages (from-to)952-954
Number of pages3
JournalAKCE International Journal of Graphs and Combinatorics
Volume17
Issue number3
DOIs
StatePublished - 2020

Bibliographical note

Funding Information:
The authors would like to thank the anonymous referees whose helpful comments and suggestions helped to improve the paper.

Keywords

  • Cartesian product of cycles
  • Magic-type labeling
  • group supermagic labeling
  • supermagic labeling
  • vertex-magic edge labeling

Fingerprint Dive into the research topics of 'Note on diagonal construction of -supermagic labeling of'. Together they form a unique fingerprint.

Cite this