{
  "aliases": [
    "bowtie-graph",
    "bowtie-free-graph",
    "bowtie-free-graphs",
    "hourglass-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical field of graph theory, the **butterfly graph** (also called the **bowtie graph** and the **hourglass graph**) is a [[planar|029JQEK15B]], undirected graph with 5 vertices and 6 edges. It can be constructed by joining 2 copies of the [[cycle graph|0QQ0F12962]] $C_{3}$ with a common vertex and is therefore [[isomorphic|00CT0PTH74]] to the friendship graph $F_{2}$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "bowtie-graph",
      "bowtie-free-graph",
      "bowtie-free-graphs",
      "hourglass-graph"
    ],
    "inventory": [
      "NCCN4BY2YD"
    ],
    "kind": "concept",
    "name": "Butterfly graph",
    "same_as": {
      "wikidata": "Q3035340",
      "wikipedia": "Butterfly graph"
    },
    "sources": [
      {
        "locator": "Butterfly graph",
        "mention": "wikipedia://en/4372111",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:4372111@r1184387459"
      }
    ],
    "tag": "7GM0HNC8RG"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/7GM0HNC8RG/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/7GM0HNC8RG.md",
  "msc": null,
  "name": "Butterfly graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/7GM/7GM0HNC8RG.md",
  "status": null,
  "tag": "7GM0HNC8RG",
  "uri": "m2://7GM0HNC8RG",
  "url": "https://math2.tamnd.com/wiki/butterfly-graph/",
  "writing": {
    "tag": "7GM0HNC8RG",
    "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
      }
    ]
  }
}