On the Index Set of Complete Multipartite Graphs

For an undirected graph g, and an abelian group a, an a-magic labelling is an assignment of non-zero element of a, to the edges of g, such that the sum of the values of all edges incident with each vertex is constant. a constant on magic sum is called an index set of g. shiu and low proved that, zero is in the index set of complete multipartite graph. in this paper, for t ≥ 2 we determine the index set of the complete multipartite graph kn1,...,nt , where ni ≥ 2 (for i = 1, . . . , t).