H-Supermagic Labeling on Shrubs Graph and Lm ⊙ Pn

A finite simple graph G admits an H-covering if every edge of E(G) belongs to a subgraph of G isomorphic to H. We said the graph G = (V, E) that admits H-covering to be H-magic if there exists a bijection function f : V (G) boolean OR E(G) -> {1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar} such that for each subgraph H' of G isomorphic to H, f (H') = E-v is an element of V' f (v) + Sigma(e is an element of E') f (e) = m(f) is constant. Furthermore, if f (V) = 1, 2,...,vertical bar V (G)vertical bar then G is called H-supermagic. In this research we defined S-2,S-2-supermagic labeling on shrub graph S(m(1), m(2),..., m(n)) and fish-supermagic labeling on L-m circle dot P-n for m, n >= 2.