H-E-super magic decomposition of complete bipartite graphs

An H-magic labeling of a H-decomposable graph G is a bijection f:V(G)∪E(G)→{1,2,…,p+q} such that for every copy H in the decomposition, ∑v∈V(H)f(v)+∑e∈E(H)f(e) is constant. The labeling f is said to be H-E-super magic if f(E(G))={1,2,…,q}. In this paper, we prove that a complete bipartite graph is H-E-super magic decomposable where H≅K1,n with n≥1.