---
tag: 6F75HN0W6J
kind: concept
name: Friendship graph
aliases: [dutch-windmill-graph, n-fan]
sources:
  - wikipedia: en:24363442@r1369270455
    locator: Friendship graph
    note: adopted
    mention: wikipedia://en/24363442
    sections: [Summary]
same_as:
  wikidata: Q5504427
  wikipedia: Friendship graph
inventory: [N087Q2ZC6P]
---

## Summary

In the mathematical field of graph theory, the **friendship graph** (or **Dutch windmill graph** or **$n$-fan**) $F_{n}$ is a [[planar|029JQEK15B]], undirected graph with $2n + 1$ vertices and $3n$ edges.