H− Supermagic labeling on domino ʘ Pn and Cn ◊ Sn

Abstract

A finite simple graph G with vertex set V and edge set E admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. We said G to be an H magic if there exists a total labeling , such that for each subgraph H’ = (V’, E’) of G isomorphic to H, ∑v∈V f(v) + ∑e∈E f(e) = m(f) where m(f) is a constant magic sum. Then G is H supermagic if f(V ) = {1, 2, …, |V (G)|}. The edge corona product between graph G1 and G2 is a graph obtained by taking one copy of G1 and |E(G1)| copies of G2 and then joining two end − vertices of the ith edge of G1 to every vertex in ith copy of G2. This research focuses on C4 ʘ Pn− supermagic labeling on Domino ʘ Pn and P2 ◊ Sn supermagic labeling on Cn ◊ Sn.