On totally antimagic total labeling of complete bipartite graphs
  This paper deals with the problem of finding totally antimagic total labelings of complete bipartite graphs. We prove that complete bipartite graphs are totally antimagic total graphs. We also show that the join of complete bipartite graphs with one vertex is a totally antimagic total graph 
Abolape D. Akwu and Deborah O. A. Ajayi
math.CO