{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nThe Cameron graph is a strongly regular graph of parameters $(231, 30, 9, 3)$. This means that it has 231 vertices, 30 edges per vertex, 9 triangles per edges, and 3 two-edge paths between every two non-adjacent vertices.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "16GC5REPCZ"
    ],
    "kind": "concept",
    "name": "Cameron graph",
    "same_as": {
      "wikidata": "Q25303938",
      "wikipedia": "Cameron graph"
    },
    "sources": [
      {
        "locator": "Cameron graph",
        "mention": "wikipedia://en/47090773",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:47090773@r1295689662"
      }
    ],
    "tag": "FJP9RY0AG0"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/FJP9RY0AG0/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/FJP9RY0AG0.md",
  "msc": null,
  "name": "Cameron graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/FJP/FJP9RY0AG0.md",
  "status": null,
  "tag": "FJP9RY0AG0",
  "uri": "m2://FJP9RY0AG0",
  "url": "https://math2.tamnd.com/wiki/cameron-graph/",
  "writing": {
    "tag": "FJP9RY0AG0",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}