A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Magic labellings of graphs over finite abelian groups

2004
*
The Australasian Journal of Combinatorics
*

A total labelling of a graph with v vertices and e edges is a one-to-one map taking the vertices and edges onto the set {1, 2, 3, . . . , v + e}. A labelling can be used to define a weight for each vertex and edge. For a vertex the weight is the sum of the label of the vertex and the labels of the incident edges. For an edge {x, y} the weight is the sum of the label of the edge and the labels of the end vertices x and y. A labelling is vertex-magic if all the vertices have the same weight. A

dblp:journals/ajc/CombeNP04
fatcat:wvle56jg2jcmpio2m27k7pbm2y