On super (a,d)(a,d)-edge-antimagic total labeling of disconnected graphs

A graph GG of order pp and size qq is called (a,d)(a,d)-edge-antimagic total   if there exists a bijection f:V(G)∪E(G)→{1,2,…,p+q}f:V(G)∪E(G)→{1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv),uv∈E(G)w(uv)=f(u)+f(v)+f(uv),uv∈E(G), form an arithmetic sequence with the first term aa and common difference dd. Such a graph GG is called super   if the smallest possible labels appear on the vertices. In this paper we study super (a,d)(a,d)-edge-antimagic total properties of disconnected graphs mCnmCn and mPnmPn.