… d = 0 and n = 3 , or (ii) d = 1 and n ⩾ 3 , or (iii) d = 2 and n = 3 . In the present paper we prove
that mK n is super ( a , d ) -edge-antimagic total for certain values of parameters d, n and m. …

… if the smallest possible labels appear on the vertices. In … super (a, d)-edge-antimagic total
labeling of the complete bipartite graph Km,n and obtain the following results: the graph Km,n …

… and Hall) [3] Hartsfield N dan Ringel G 1994 Pearls in Graph … M 2011 Super edge-antimagic
total labelings of mKn,n Ars … The construction of super local edge antimagic total coloring by …

… A total labeling of graph G(V,E) is said to be local edge antimagic total labeling if a bijection f
: … The local edge antimagic total labeling induces a proper edge coloring of G if each edge e …

… of super (a, d)-edge-antimagic total labeling on mKn. … there is no super (a, d)-edge-antimagic
total labeling except d = 1… to have a super (a, d)-edge-antimagic total labeling for d = 0 or d …

… is a total labeling of G and the associated edge-weights are ( ) … The total labeling is
called an ( , ) ad edge-antimagic total labeling ((a, d)-EAT for short) of G if the set of all edge- …

… a super (a, 0)-edge antimagic total labeling and a super (a, 2)edge antimagic total labeling
of … Also we study the super (a, d)-edge antimagic total labeling of fan graphs and two special …

… about super (a; d)-edge-antimagic total labeling because it … super (a; d)-edge-antimagic
total labelings of lampion graph and it will be concentrated on the connected Lampion graph £n,…

… They determined super edge-antimagic total labelings of mKn,n and super edge-… Case 1:
For n is odd and m is odd, we will show that the lower bound of the local edge antimagic total …

… On super edgeantimagic total labelings of mKn. Discrete mathematics, 308(22), 5032-5037.
[2] Bača, M., Kovář, P., Semaničová–Feňovčíková, A., & Shafiq, MK (2010). …