Journal of Applied Mathematics
Volume 2013 (2013), Article ID 896815, 6 pages
Research Article

On Super -Edge-Antimagic Total Labeling of Special Types of Crown Graphs

1FAST-National University of Computer and Emerging Sciences, Peshawar 25000, Pakistan
2Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia

Received 8 April 2013; Accepted 9 June 2013

Academic Editor: Zhihong Guan

Copyright © 2013 Himayat Ullah et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


For a graph , a bijection from is called -edge-antimagic total ( -EAT) labeling of if the edge-weights , form an arithmetic progression starting from and having a common difference , where and are two fixed integers. An -EAT labeling is called super -EAT labeling if the vertices are labeled with the smallest possible numbers; that is, . In this paper, we study super -EAT labeling of cycles with some pendant edges attached to different vertices of the cycle.