%0 Journal Article
%T Mixed cycle-E-super magic decomposition of complete bipartite graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Marimuthu, G.
%A Stalin Kumar, S.
%D 2016
%\ 06/01/2016
%V 47
%N 1
%P 37-52
%! Mixed cycle-E-super magic decomposition of complete bipartite graphs
%K H-decomposable graph
%K H-E-super magic labeling
%K mixed cycle-E-super magic decomposable graph
%R 10.22059/jac.2016.7934
%X 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].
%U https://jac.ut.ac.ir/article_7934_5f537569fcfee7d3d929abdef859d33f.pdf