---
tag: 9TKMQ9RWZN
kind: concept
name: Windmill graph
sources:
  - wikipedia: en:24373456@r1326505607
    locator: Windmill graph
    note: adopted
    mention: wikipedia://en/24373456
    sections: [Summary]
same_as:
  wikidata: Q8024306
  wikipedia: Windmill graph
inventory: [ED3JHWVFB4]
---

## Summary

In the mathematical field of graph theory, the **windmill graph** $\operatorname{Wd}(k,n)$ is an undirected graph constructed for $k \ge 2$ and $n \ge 2$ by joining $n$ copies of the [[complete graph|03WKB2H474]] $K_{k}$ at a shared universal vertex. That is, it is a 1-clique-sum of these complete graphs.