{
  "id": "1401.7928",
  "version": "v2",
  "published": "2014-01-30T17:25:29.000Z",
  "updated": "2014-07-27T13:51:43.000Z",
  "title": "On Linkedness of Cartesian Product of Graphs",
  "authors": [
    "Gabor Meszaros"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of cycles.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-07-27T13:51:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cartesian product",
      "study linkedness",
      "determine linkedness",
      "linked graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}