Super Magic Labelling of Complete Bipartite Graphs

The study of graph labelling has focused on finding classes of graphs which admits a particular type of labelling. A graph is called super magic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of super magic labelling of regular graphs are described. Super magic regular complete bipartite graphs are characterized.