Contents

-

Super (a,1)-cycle-antimagic labeling of the grid

Ming-Ju Lee1, Wei-Han Tsai2, Chiang Lin2
1Jen-Teh Junior College of Medicine, Nursing and Management Houlong, Miaoli, Taiwan 356, R.O.C.
2Department of Mathematics National Central University, Chung-Li, Taiwan 320, R.O.C.

Abstract

Let G and F be graphs. If every edge of G belongs to a subgraph of G isomorphic to F, and there exists a bijection λ:V(G)E(G){1,2,,|V(G)|+|E(G)|} such that the set {vV(F)λ(v)+eE(f)λ(e):FF,FG} forms an arithmetic progression starting from a and having common difference d, then we say that G is (a,d)-F-antimagic. If, in addition, λ(V(G))={1,2,,|V(G)|}, then G is \emph{super} (a,d)-F-antimagic. In this paper, we prove that the grid (i.e., the Cartesian product of two nontrivial paths) is super (a,1)-C4-antimagic.