A graph G of order p and size q is called an (a, d)-edge- antimagic total if there exist a bijection f : V (G)U E(G) ---> {1,2,3,4,5,...., p+ q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv in E(G), form ...