On Super(a,d)-Edge-Antimagic Total Labeling of Special Types of Crown Graphs

[摘要] For a graphG=(V,E), a bijectionffromV(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|}is called(a,d)-edge-antimagic total ((a,d)-EAT) labeling ofGif the edge-weightsw(xy)=f(x)+f(y)+f(xy),xy∈E(G), form an arithmetic progression starting fromaand having a common differenced, wherea>0andd≥0are 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.

[学科分类] 应用数学