construct windmill graph
posint; size of copy of complete graph
posint; number of copies of complete graph
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.
W ≔ WindmillGraph⁡4,3
W≔Graph 1: an undirected graph with 10 vertices and 18 edge(s)
The GraphTheory[SpecialGraphs][WindmillGraph] command was introduced in Maple 2023.
For more information on Maple 2023 changes, see Updates in Maple 2023.
Download Help Document