windmill graph

noun1

1. •
   The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kₖ at a shared universal vertex.