Group distance magic and antimagic graphs

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 all vertices of G have the same weight. In this paper we study these new labellings with a focus on product graphs.

Original languageEnglish (US)
Pages (from-to)41-48
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume48
DOIs
StatePublished - Jul 1 2015

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

Publisher Copyright:
© 2015 Elsevier B.V.

Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

Keywords

  • Distance antimagic labelling
  • Distance magic labelling
  • Group labelling

Fingerprint

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

Cite this