Suppose is a finite plane graph with vertex set , edge set , and face set . The paper deals with the problem of labeling the vertices, edges, and faces of a plane graph in such a way that the label of a face and labels of vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called -antimagic if for every number , the -sided face weights form an arithmetic progression of difference . In this paper, we investigate the existence of -antimagic labelings for a special class of plane graphs.