On H-supermagic labeling of friendship edge corona product with path and sun edge corona product with path
Titik Dwi Noviati, Till Martini, Diari Indriati · Journal of Physics Conference Series · 2019
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 f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , | V ( G ) | + | E ( G ) | } , such that each subgraph H′ = (V′, E′) of G isomorphic to H and satisfying f ( H ′ ) def = ∑ υ ∈ V ( H ′ ) f ( υ ) + ∑ e ∈ E ( H ′ ) f ( e ) = m ( f ) 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 G 1 and G 2 is a graph obtained by taking one copy of G 1 and |E(G 1)| copies of G 2 and then joining two end − vertices of the ith edge of G 1 to every vertex in ith copy of G 2. This research provides C 3 ◊ Pn -supermagic labeling on fn ◊ Pn and P 3 ◊ Pn -supermagic labeling on Sn ◊ Pn .