{
  "id": "1301.0374",
  "version": "v2",
  "published": "2013-01-03T04:15:19.000Z",
  "updated": "2013-01-05T02:17:18.000Z",
  "title": "The triangle-free graphs with rank 6",
  "authors": [
    "Long Wang",
    "Yi-Zheng Fan",
    "Yi Wang"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The rank of a graph G is defined to be the rank of its adjacency matrix A(G). In this paper we characterize all connected triangle-free graphs with rank 6.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-01-05T02:17:18.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50"
    ],
    "keywords": [
      "adjacency matrix",
      "connected triangle-free graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1301.0374W"
    }
  }
}