On H-supermagic labeling of friendship edge corona product with path and sun edge corona product with path

Abstract

Let G be a simple, finite, connected and undirected graph with vertex set V and edge set E. Graph G admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. Graph G is H− magic if there is a total labeling , such that each subgraph H′ = (V′, E′) of G isomorphic to H and satisfying where m(f) is a constant magic sum. Additionaly, G admits 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 provides C3 ◊ Pn-supermagic labeling on fn ◊ Pn and P3 ◊ Pn-supermagic labeling on Sn ◊ Pn.