Abolape D. Akwu, Deborah O. A. Ajayi
Published 2016-01-09Version 1
This paper deals with the problem of finding totally antimagic total labeling of complete bipartite graphs. We prove that complete bipartite graphs with equal number of vertices in each partite set and complete bipartite graphs with different number of vertices in each partite set are totally antimagic total graphs. We also show that the join of complete bipartite graphs with one vertex is a totally antimagic total graph.
$\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs
A Note on the Equitable Choosability of Complete Bipartite Graphs
Weak saturation numbers of complete bipartite graphs in the clique
![QR code for arXiv:1601.02112 [math.CO]](http://oss.arxitics.com/images/favicon.svg)