e/Windmill graph

Information
has gloss	eng: In the mathematical field of graph theory, the windmill graph Wd(k,n) is a simple undirected graph with (k-1)n+1 vertices and nk(k−1)/2 edges. It is defined for k ≥ 2 and n ≥ 2.
lexicalization	eng: windmill graph
instance of	(noun) (computer science) the organization of data (and its storage allocations in a computer) data structure

Media
media:img	Windmill graph Wd(5,4).svg
media:img	Windmill graphs.svg