Super complete-antimagicness of Amalgamation of any Graph

Let H_i be a finite collection of simple, nontrivial andundirected graphs and let each H_i have a fixed vertex v_jcalled a terminal. The amalgamation H_i as v_j as a terminal isformed by taking all the H_i's and identifying their terminal.When H_(i )are all isomorphic graphs, for any positif integer nwe denote such amalgamation by G=Amal(H,v,n), where ndenotes the number of copies of H. The graph G is said to be an(a,d)-H-antimagic total graph if there exist a bijectivefunction f: V(G)∪ E(G)â†' {1,2,… ,|V (G)| +|E(G)|} such that for all subgraphs isomorphic to H, the totalH-weights W(H)=∑_(v∈ V(H)) f(v)+∑_(e∈ E(H)) f(e) forman arithmetic sequence {a,a + d,a +2d,...,a+(n - 1)d}, wherea and d are positive integers and n is the number of allsubgraphs isomorphic to H. An (a,d)-H-antimagic total labelingfis called super if the smallest labels appear in the vertices.In this paper, we study a super (a,d)-H antimagic totallabeling of G=Amal(H,v,n) and its disjoint union.