Super d-antimagic labeling of uniform subdivision of wheel^O

This paper deals with the problem of labeling the vertices, edges and faces of uniform subdivision of wheel. A weight of a face is the sum of the label of a face and the labels of the vertices and edges surrounding that face. In a super d-antimagic labeling the vertices receive the smallest labels and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appearing in the graph. The paper examines the existence of super d-antimagic labelings of type (1,1,1) for uniform subdivision of wheel for certain differences d.