Let G = G(V, E) be a finite simple undirected graph with vertex set V and edge set E, where |E| and |V | are the number of edges and vertices on G. An (a, d)-edge antimagic vertex ((a, d)-EAV) labeling is a one-toone mapping f from V (G) onto {1, 2, . . . , |V |} with the property that for every edge xy ∈ E, the edge-weight set is equal to {f(x) + f(y) : x,… (More)