{
  "id": "1601.02112",
  "version": "v1",
  "published": "2016-01-09T13:50:57.000Z",
  "updated": "2016-01-09T13:50:57.000Z",
  "title": "On totally antimagic total labeling of complete bipartite graphs",
  "authors": [
    "Abolape D. Akwu",
    "Deborah O. A. Ajayi"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-01-09T13:50:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C78"
    ],
    "keywords": [
      "complete bipartite graphs",
      "totally antimagic total labeling",
      "totally antimagic total graph",
      "partite set",
      "finding totally antimagic total"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160102112A"
    }
  }
}