期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Group Distance Magic and Antimagic Graphs
1
作者 S.CICHACZ D.FRONCEK +1 位作者 K.SUGENG sanming zhou 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2016年第10期1159-1176,共18页
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... 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. 展开更多
关键词 Distance magic labelling distance antimagic labelling group labelling
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部