Dutch Windmill Graph


The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), and therefore corresponds to the usual windmill graph W_3^((m)). It is therefore natural to extend the definition to D_n^((m)), consisting of m copies of C_n.

By construction, the Dutch windmill graph D_n^((m)) has anarboricity m.

Precomputed properties of Dutch windmill graphs are implemented in the Wolfram Language as GraphData[{"DutchWindmill", {m, n}}].

See also

Windmill Graph

Explore with Wolfram|Alpha


Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018.

Referenced on Wolfram|Alpha

Dutch Windmill Graph

Cite this as:

Weisstein, Eric W. "Dutch Windmill Graph." From MathWorld--A Wolfram Web Resource.