Let G = (V (G), E(G)) be a graph with v = |V (G)| vertices and e = |E(G)| edges. A bijective function ? : V (G) ? E(G) ? {1, 2, . . . , v + e} is called an (a, d)- edge antimagic total (EAT) labeling(valuation) if the ...