On super (a,d)-edge-antimagic total labeling of special types of crown graphs

For a graph g=(v,e),a bijection f from v(g)∪e(g)→{1,2,.,|v(g) |+|e(g)|} is called (a,d)-edge-antimagic total ((a,d)-eat) labeling of g if the edge-weights w(xy)=f(x)+f(y)+f(xy),xy e(g),form an arithmetic progression starting from a and having a common difference d,where a>0 and d≥0 are two fixed integers. an (a,d)-eat labeling is called super (a,d)-eat labeling if the vertices are labeled with the smallest possible numbers; that is,f(v)={1,2,.,|v(g)|}. in this paper,we study super (a,d)-eat labeling of cycles with some pendant edges attached to different vertices of the cycle. © 2013 himayat ullah et al.