{
  "id": "1110.1240",
  "version": "v1",
  "published": "2011-10-06T12:19:57.000Z",
  "updated": "2011-10-06T12:19:57.000Z",
  "title": "On Graphs with the Smallest Eigenvalue at Least $-1-\\sqrt{2}$, part II",
  "authors": [
    "Tetsuji Taniguchi"
  ],
  "comment": "16 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "This is a continuation of the article with the same title. In this paper, the family H is the same as in the previous paper \"On Graphs with the Smallest Eigenvalue at Least $-1-\\sqrt{2}$, part I\". The main result is that a minimal graph which is not an H -line graph, is just isomorphic to one of the 38 graphs found by computer.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-10-06T12:19:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "smallest eigenvalue",
      "main result",
      "minimal graph",
      "line graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1110.1240T"
    }
  }
}