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 C_4 - supermagic covering of grid graph and C_3 - supermagic covering of K_(1,n) + K_2.
展开▼
