TY - JOUR
T1 - Group distance magic and antimagic graphs
AU - Cichacz, S.
AU - Froncek, D.
AU - Sugeng, K.
AU - Zhou, Sanming
N1 - Publisher Copyright:
© 2015 Elsevier B.V.
PY - 2015/7/1
Y1 - 2015/7/1
N2 - 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.
AB - 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.
KW - Distance antimagic labelling
KW - Distance magic labelling
KW - Group labelling
UR - http://www.scopus.com/inward/record.url?scp=84937485220&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937485220&partnerID=8YFLogxK
U2 - 10.1016/j.endm.2015.05.007
DO - 10.1016/j.endm.2015.05.007
M3 - Article
AN - SCOPUS:84937485220
SN - 1571-0653
VL - 48
SP - 41
EP - 48
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -