Abstract
A k-magic labeling   of a finite, simple graph with |V(G)|=p |V(G)|=p <!--mathContainer--> <!--Loading Mathjax--> and |E(G)|=q, |E(G)|=q, <!--mathContainer--> <!--Loading Mathjax--> is a bijection from the set of edges into the integers {1,2,3,…,q} {1,2,3,…,q} <!--mathContainer--> <!--Loading Mathjax--> such that the vertex set V V <!--mathContainer--> <!--Loading Mathjax--> can be partitioned into k k <!--mathContainer--> <!--Loading Mathjax--> sets V1,V2,V3,…,Vk,1≤k≤p, V1,V2,V3,…,Vk,1≤k≤p, <!--mathContainer--> <!--Loading Mathjax--> and each vertex in the set Vi Vi <!--mathContainer--> <!--Loading Mathjax--> has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a vertex sum is the sum of the labels of all edges incident with that vertex. A graph is called k-magic   if it has k k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling, for some k k <!--mathContainer--> <!--Loading Mathjax--> , 1≤k≤p. 1≤k≤p. <!--mathContainer--> <!--Loading Mathjax--> The study of k k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling is interesting, since all magic graphs are 1-magic and all antimagic graphs are p p <!--mathContainer--> <!--Loading Mathjax--> -magic. In this paper, we discuss the k k <!--mathContainer--> <!--Loading Mathjax--> -magicness of the Complete bipartite graph Kp,p, Kp,p, <!--mathContainer--> <!--Loading Mathjax--> where 1≤k≤2p. 1≤k≤2p. <!--mathContainer--> <!--Loading Mathjax-->