{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a branch of mathematics, a **crown graph** on $2n$ vertices is an undirected graph with two sets of vertices $\\{u_{1}, u_{2}, \\ldots, u_{n}\\}$ and $\\{v_{1}, v_{2}, \\ldots, v_{n}\\}$ and with an edge from $u_{i}$ to $v_{j}$ whenever $i \\ne j$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "ES07NQ4PMV"
    ],
    "kind": "concept",
    "name": "Crown graph",
    "same_as": {
      "wikidata": "Q3115466",
      "wikipedia": "Crown graph"
    },
    "sources": [
      {
        "locator": "Crown graph",
        "mention": "wikipedia://en/21062705",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:21062705@r1301545999"
      }
    ],
    "tag": "TM2DNJZHC1"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/TM2DNJZHC1/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/TM2DNJZHC1.md",
  "msc": null,
  "name": "Crown graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/TM2/TM2DNJZHC1.md",
  "status": null,
  "tag": "TM2DNJZHC1",
  "uri": "m2://TM2DNJZHC1",
  "url": "https://math2.tamnd.com/wiki/crown-graph/",
  "writing": {
    "tag": "TM2DNJZHC1",
    "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
      }
    ]
  }
}