Face Antimagic Labeling of Jahangir Graph
This paper deals with the problem of labeling the vertices, edges and faces of a plane graph. 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 for Jahangir graphs for certain differences d.
KeywordsPlane graph d-antimagic labeling Jahangir graph
Mathematics Subject Classification (2010)Primary 05C78 Secondary 05C38
Unable to display preview. Download preview PDF.
- 1.Ahmad, A., Bača, M.: On vertex irregular total labelings. Ars Combin (in press)Google Scholar
- 14.Ma, K.J., Feng, C.J.: On the gracefulness of gear graphs. Math. Practice Theory. 72–73 (1984)Google Scholar
- 17.West D.B.: An Introduction to Graph Theory. Prentice- Hall, Prentice (1996)Google Scholar