Group distance magic and antimagic graphs

S. Cichacz, Dalibor Froncek, K. Sugeng, Sanming Zhou

Research output: Contribution to journalArticlepeer-review

Abstract

Given a graph G with n vertices and an Abelian group A of order n, an A-distance antimagic labelling of G is a bijection from V (G) to A such that the vertices of G have pairwise distinct weights, where the weight of a vertex is the sum (under the operation of A) of the labels assigned to its neighbours. An A-distance magic labelling of G is a bijection from V (G) to A such that the weights of all vertices of G are equal to the same element of A. In this paper we study these new labellings under a general setting with a focus on product graphs. We prove among other things several general results on group antimagic or magic labellings for Cartesian, direct and strong products of graphs. As applications we obtain several families of graphs admitting group distance antimagic or magic labellings with respect to elementary Abelian groups, cyclic groups or direct products of such groups.

Original languageEnglish (US)
Pages (from-to)1159-1176
Number of pages18
JournalActa Mathematica Sinica, English Series
Volume32
Issue number10
DOIs
StatePublished - Oct 1 2016
Externally publishedYes

Bibliographical note

Funding Information:
1 Partially supported by the Polish Ministry of Science and Higher Education. 2 Email: cichacz@agh.edu.pl 3 Email: dalibor@d.umn.edu 4 Email: kiki@sci.ui.ac.id 5 Supported by the Australian Research Council. 6 Email: smzhou@ms.unimelb.edu.au

Keywords

  • Distance magic labelling
  • distance antimagic labelling
  • group labelling

Fingerprint Dive into the research topics of 'Group distance magic and antimagic graphs'. Together they form a unique fingerprint.

Cite this