On super -edge-antimagic total labeling of disconnected graphs

A graph G of order p and size q is called ( a , d ) -edge-antimagic total if there exists a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , p + q } such that the edge-weights, w ( u v ) = f ( u ) + f ( v ) + f ( u v ) , u v ∈ 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. In this paper we study super ( a , d ) -edge-antimagic total properties of disconnected graphs m C n and m P n .