Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic total if there exist a bijection f : V (G) ∪ E(G) → {1, 2,...,p + q} such that the edge-weights, w(uv) = f(u)+f(v)+f(uv); u, v ∈ V ...