Cycle-supermagic covering on grid graph and K1,n+K¯2
T. S. Martini, Mania Roswitha, Diana Ayu Lestari · AIP conference proceedings · 2018
A simple graph G (V, E) admits an H- magic covering if every edge E belongs to subgraph of G isomorphic to H and there exists a bijection function λ: V (G) ∪ E(G) → {1,2,…,|V(G)|} + |E(G)|} such that for all subgraph H′ = (V′, E′) isomorphic to H and satisfying λ(H′)=defΣvϵV′,f(v)+ΣeϵE′,f(e)=m(f), where m(f) is constant magic sum. A graph G is an H- supermagic labeling if λ(V) = {1,2,…,|V(G)|} and s(f) is a constant supermagic sum. This work aim is to study C4 − supermagic covering of grid graph and C3 − supermagic covering of K1,n+K¯2.