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.