Antimagic labelings of grids

Abstract:

In this paper we deal with the problem of labeling the vertices, edges and faces of a grid graph by the consecutive integers from 1 to |V| + |E| + |F| in such a way that the label of a face and the labels of the vertices and edges surrounding that face all together add up to a weight of that face. These face weights then form an arithmetic progression with common difference d.

Año de publicación:

2007

Keywords:

• Antimagic labeling
• Labeling of type (1,1,1)
• Face weight
• Grid
• Graph labeling

Fuente:

scopus