PELABELAN SELIMUT AJAIB SUPER PADA KELAS GRAF KORONA TERTENTU

A simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic to H. A graph G is H magic if there is a total labeling, such that each sobgraph of G isomorphic to H satisfies where m(f) is a constant magic sum. Furthermore, f is an H-supermagic covering if f(V) - {1,2,...,[V(G)]} This research aims to study H-supermagic covering on corona of graph cycle with path corona of graph path with cycle and fan k-multi level corona with path. We prove that a cycle corona path is supermagic for and the greatest common divisor of n and k(k-1) is 1, a path corona cycle is a supermagic for , and a fan k-multilevel corona path is a supermagic for . Keywords: H-supermagic covering, corona, path, cycle, fa