By an -edge-antimagic total labeling of a graph , we mean a bijective function from onto the set such that the set of all the edge-weights, , for , is , for two integers and .
In this paper, we study the edge-antimagic properties for the disjoint union of complete -partite graphs.
Keywords: complete s-partite graph, (a, d)-edge-antimagic total la- beling, super (a, d)-edge-antimagic total labeling.