{
  "id": "1404.3553",
  "version": "v1",
  "published": "2014-04-14T12:24:32.000Z",
  "updated": "2014-04-14T12:24:32.000Z",
  "title": "Maximum order of triangle-free graphs with a given rank",
  "authors": [
    "E. Ghorbani",
    "A. Mohammadian",
    "B. Tayfeh-Rezaie"
  ],
  "comment": "14 pages, 4 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-04-14T12:24:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "05C75",
      "15A03"
    ],
    "keywords": [
      "maximum order",
      "reduced triangle-free graphs",
      "adjacency matrix",
      "isolated vertices"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1404.3553G"
    }
  }
}