Abstract. A simple graph G = (V;E) admits an H-labeling if every edge e ∈ E(G) belongs to
a subgraph of G isomorphic to H. Furthermore, G contains H-labeling if there exists a bijection
function f : V (G) ∪ E(G) → {1; 2; · · · ; |V (G)| + |E(G)|}, such that for each subgraph H
′
of G
isomorphic to H, f(H
′
) =
Σ
v∈V f(v) ×Σ
e∈E f(e) = m(f) where m(f) is a magic sum. Then
G is an H-supermagic if f(V ) = {1; 2; · · · ; |V (G)|}. This research aims to nd H-super magic
labeling on corona product, which: a fan graph with a path (Fn ? Pm) where n ≥ 4;m ≥ 3,
a ladder graph with a path (Ln ? Pm), where n;m ≥ 3, and a windmill graph with a path
(W3;m ? Pm) where m ≥ 3. The result show that Fn ? Pm for m ≥ 3 and n ≥ 4 is C3 ? Pm-
supermagic, a Ln ? Pm for m; n ≥ 3 is C4 ? Pm-supermagic, and W3;m ? Pm for m ≥ 3 is
C3 ? Pm-supermagic.
Keywords : H-supermagic labeling, fan graph, ladder graph, windmill graph, path