WindmillGraph(k,n) creates a windmill graph with n*(k-1)+1 vertices and n*k*(k-1)/2 edges. This consists of n copies of the complete graph on k vertices which are joined at a shared universal vertex.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$W≔\mathrm{WindmillGraph}\left(4\,3\right)$

$W≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 10\; vertices\; and\; 18\; edge(s)}$

$\mathrm{IsPlanar}\left(W\right)$

$\mathrm{true}$

$\mathrm{NumberOfEdges}\left(W\right)$

$18$

$\mathrm{DrawGraph}\left(W\right)$

The GraphTheory[SpecialGraphs][WindmillGraph] command was introduced in Maple 2023.

For more information on Maple 2023 changes, see Updates in Maple 2023.