{
  "id": "2207.14333",
  "version": "v1",
  "published": "2022-07-28T18:22:49.000Z",
  "updated": "2022-07-28T18:22:49.000Z",
  "title": "Computation of twin-width of graphs",
  "authors": [
    "Kajal Das"
  ],
  "comment": "Comments are welcome!",
  "categories": [
    "math.CO"
  ],
  "abstract": "Twin-width is a recently introduced graph parameter. In this article, we compute twin-width of various finite graphs. In particular, we prove that the twin-widths of finite graphs with 4 and 5 vertices are less than equal to 1 and 2, respectively. We show that the constructions of dual graph and line graph do not preserve twin-width. Also, we give upper bounds for the twin-width of King's graph and Rook's graph.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-07-28T18:22:49.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C30",
      "05C38",
      "05C76",
      "68R10"
    ],
    "keywords": [
      "computation",
      "finite graphs",
      "kings graph",
      "upper bounds",
      "rooks graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}