Group distance magic and antimagic graphs

S. Cichacz, D. Froncek, K. Sugeng, Sanming Zhou
<span title="2016-09-15">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="" style="color: black;">Acta Mathematica Sinica. English series</a> </i> &nbsp;
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
more &raquo; ... 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/s10114-016-4646-9</a> <a target="_blank" rel="external noopener" href="">fatcat:ix5vzm353ndbzjtw325xyj3gwy</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>