A total labeling of a graph with vertices and edges is a one-to-one mapping from onto . If the edge-weights (resp. vertex-weights) form an arithmetic progression starting from and having common difference , then the labeling is called an -edge (resp. vertex) – antimagic total labeling. In this paper, we consider such labeling applied to the generalized Petersen graph.