A new class of antimagic Cartesian product graphs

An antimagic labeling   of a finite undirected simple graph with mm edges and nn vertices is a bijection from the set of edges to the integers 1,…,m1,…,m such that all nn-vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic   if it has an antimagic labeling. In 1990, Hartsfield and Ringel [N. Hartsfield, G. Ringel, Pearls in Graph Theory, Academic Press, INC., Boston, 1990, pp. 108–109, Revised version, 1994] conjectured that every simple connected graph, except K2K2, is antimagic. In this article, we prove that a new class of Cartesian product graphs are antimagic. In particular, by combining this result and the antimagicness result on toroidal grids (Cartesian products of two cycles) in [Tao-Ming Wang, Toroidal grids are anti-magic, in: Proc. 11th Annual International Computing and Combinatorics Conference COCOON’2005, in: LNCS, vol. 3595, Springer, 2005, pp. 671–679], all Cartesian products of two or more regular graphs of positive degree can be proved to be antimagic.