{
  "id": "1101.3386",
  "version": "v1",
  "published": "2011-01-18T05:52:00.000Z",
  "updated": "2011-01-18T05:52:00.000Z",
  "title": "The crossing number of folded hypercubes",
  "authors": [
    "Haoli Wang",
    "Yuansheng Yang",
    "Yan Zhou",
    "Wenping Zheng",
    "Guoqing Wang"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. The {\\it $n$-dimensional folded hypercube} $FQ_n$ is a graph obtained from $n$-dimensional hypercube by adding all complementary edges. In this paper, we obtain upper and lower bounds of the crossing number of $FQ_n$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-01-18T05:52:00.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "crossing number",
      "minimum number",
      "complementary edges",
      "dimensional hypercube",
      "dimensional folded hypercube"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}