---
tag: 7GM0HNC8RG
kind: concept
name: Butterfly graph
aliases: [bowtie-graph, bowtie-free-graph, bowtie-free-graphs, hourglass-graph]
sources:
  - wikipedia: en:4372111@r1184387459
    locator: Butterfly graph
    note: adopted
    mention: wikipedia://en/4372111
    sections: [Summary]
same_as:
  wikidata: Q3035340
  wikipedia: Butterfly graph
inventory: [NCCN4BY2YD]
---

## Summary

In 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}$.