Let G = (V(G),E(G)) be a simple, finite, connected graph where V is a set of vertices, and E is a set of edges. Graph labeling is a mapping from the set of vertices, edges, or both vertices and edge to integers. The types of graph labeling which is still widely studied today is antimagic labelings. Graph G admits an H-covering, if every edge in E(G) belongs to a subgraph of G that is isomorphic to H. We said G to be an (a, d)-H-antimagic total labeling if there exists a bijective function f:V(G)∪E(G)→{1,2,...|V(G)|+|E(G)|} such that for each subgraph H'=(V',E') of G isomorphic to H. The H-weights satisfying ω(H')=∑_(v∈V(H')) f(v) + ∑_(e∈E(H')) f(e) constitute an arithmetic series {a,a+d,a+2d,...,a+(k-1)d} where a and d are positive integer and k is the number of subgraph of G isomorphic to H. If f(V(G))={1,2...,|V(G)|}, then f is super (a,d)-H-antimagic labeling. Furthermore, in this paper we focus on super (a, d)-H-antimagic total labeling on generalized fan corona product with path (F_(m,2) ⊙ P_n) and generalized fan corona product with cycle (F_(m,2) ⊙ C_n) with H for (F_(m,2) ⊙ P_n) is (C_3 ⊙ P_n) and H for (F_(m,2) ⊙ C_n) is (C_3 ⊙ C_n). Generalized fan graph (F_(m,q)) is a join graph K_m + P_n, where K_m is null graph with m vertices, and P_n is path graph with n vertices. This research has found super (a, d)-H-antimagic total labeling of generalized fan corona product with path (F_(m,2) ⊙ P_n) and generalized fan corona product with cycle (F_(m,2) ⊙ C_n).
展开▼
