Antimagic labeling of disjoint union of s-crowns

A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by pairwise distinct integers of 1,2,..., |V(G)| + |E(G)| such that the edge-weights, w(uυ) = f(u) + f(υ) + f(uυ), uv ∈ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. A construction of super (a, d)-edge-antimagic total labelings of some disconnected graphs are described