On (a,d)-antimagic special trees, unicyclic graphs and complete bipartite graphs

A connected graph G(V, E) is said to be (a, d)- antimagic if there exist positive integers a and d and a bijection f : E --> {1, 2,...,\E\} such that the induced mapping g(f): V --> N, defined by g (v) = Sigma {f(u,v)\(u, v) is an element of E(G)) is injective and g(f) (V) = {a, a+d, a+2d,..., a+(\V\- 1)d}. In this paper, we mainly investigate (a, d)- antimagic labeling of some special trees, complete bipartite graphs K-mn and categorize (a, d)- antimagic unicyclic graphs.