windmill graph

Also known as Wd(k,n)

undirected graph constucted by joining multiple complete graphs at a shared universal vertex