On totally antimagic total labeling of complete bipartite graphs
Combinatorics
2016-08-25 v2
Abstract
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
Keywords
Cite
@article{arxiv.1601.02112,
title = {On totally antimagic total labeling of complete bipartite graphs},
author = {Abolape D. Akwu and Deborah O. A. Ajayi},
journal= {arXiv preprint arXiv:1601.02112},
year = {2016}
}