In the mathematical field of graph theory, the windmill graph Wd(k,n) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a shared vertex. That is, it is a 1-clique-sum of these complete graphs. ==Properties== It has (k-1)n+1 vertices and nk(k−1)/2 edges, girth 3 (if k > 2), radius 1 and dia...