{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical field of graph theory, the **double graph** of a simple graph $G$ is a graph derived from $G$ by a specific construction. The concept and its elementary properties were detailed in a 2008 paper by Emanuele Munarini, Claudio Perelli Cippo, Andrea Scagliola, and Norma Zagaglia Salvi.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "F9K2M9Y5JQ"
    ],
    "kind": "concept",
    "name": "Double graph",
    "same_as": {
      "wikidata": "Q137393039",
      "wikipedia": "Double graph"
    },
    "sources": [
      {
        "locator": "Double graph",
        "mention": "wikipedia://en/81397754",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:81397754@r1327644578"
      }
    ],
    "tag": "Y0WFRTGHQF"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/Y0WFRTGHQF/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/Y0WFRTGHQF.md",
  "msc": null,
  "name": "Double graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Y0W/Y0WFRTGHQF.md",
  "status": null,
  "tag": "Y0WFRTGHQF",
  "uri": "m2://Y0WFRTGHQF",
  "url": "https://math2.tamnd.com/wiki/double-graph/",
  "writing": {
    "tag": "Y0WFRTGHQF",
    "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
      }
    ]
  }
}