An H-magic labeling in 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(H)f(v) + ΣeεE(H)f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ 3, E(Hi) ∩ E(Hj) = ∅ for i ≠ j and ∪hi=1E(Hi) = E(G). In this paper, we prove that K2m,2n is mixed cycle-E-super magic decomposable where m ≥ 2, n ≥ 3, with the help of the results found in [1].
Marimuthu, G., & Stalin Kumar, S. (2016). Mixed cycle-E-super magic decomposition of complete bipartite graphs. Journal of Algorithms and Computation, 47(1), 37-52. doi: 10.22059/jac.2016.7934
MLA
G. Marimuthu; S. Stalin Kumar. "Mixed cycle-E-super magic decomposition of complete bipartite graphs". Journal of Algorithms and Computation, 47, 1, 2016, 37-52. doi: 10.22059/jac.2016.7934
HARVARD
Marimuthu, G., Stalin Kumar, S. (2016). 'Mixed cycle-E-super magic decomposition of complete bipartite graphs', Journal of Algorithms and Computation, 47(1), pp. 37-52. doi: 10.22059/jac.2016.7934
VANCOUVER
Marimuthu, G., Stalin Kumar, S. Mixed cycle-E-super magic decomposition of complete bipartite graphs. Journal of Algorithms and Computation, 2016; 47(1): 37-52. doi: 10.22059/jac.2016.7934
)