Super Face Antimagic Labelings of Union of Antiprisms
- 107 Downloads
In this paper we deal with the problem of labeling the vertices, edges and faces of a disjoint union of m copies of antiprism by the consecutive integers starting from 1 in such a way that the set of face-weights of all s-sided faces forms an arithmetic progression with common difference d, where by the face-weight we mean the sum of the label of that face and the labels of vertices and edges surrounding that face. Such a labeling is called super if the smallest possible labels appear on the vertices. The paper examines the existence of such labelings for union of antiprisms for several values of the difference d.
KeywordsPlane graph Super d-antimagic labeling Disjoint union of antiprisms
Mathematics Subject Classification (2000)05C78
Unable to display preview. Download preview PDF.
- 15.Simanjuntak, R., Miller, M., Bertault, F.: Two new (a, d)-antimagic graph labelings. In: Proceedings of Eleventh Australasian Workshop on Combinatorial Algorithms, pp. 179–189 (2000)Google Scholar