Some cycle-supermagic graphs

A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. G is H-magic if there is a total labeling f: V ∪E → {1, 2, 3, · · · , |V |+ |E|} such that for each subgraph H ′ = (V ′, E′) of G isomorphic to H, v∈V1 f(v) + e∈E1 f(e) = s is constant. When f(V) = {1, 2, · · · , |V |}, then G is said to be H-supermagic. In this paper, we show that Pm,n and the splitting graph of a cycle Cn are cycle-supermagic