The -windmill
graph is the graph obtained by taking copies of the complete graph with a vertex in common (Gallian 2011,
p. 16). The -windmill
graph is therefore isomorphic to the graph join .

Benson, M. and Lee, S. M. "On Cordialness of Regular Windmill Graphs." Congr. Numer.68, 45-58, 1989.Bermond,
J. C. "Graceful Graphs, Radio Antennae and French Windmills." Graph
Theory and Combinatorics. London: Pitman, pp. 18-37, 1979.Gallian,
J. "Dynamic Survey of Graph Labeling." Elec. J. Combin.DS6.
Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.Koh,
K. M.; Rogers, D. G.; Teo, H. K.; and Yap, K. Y. "Graceful
Graphs: Some Further Results and Problems." Congr. Numer.29,
559-571, 1980.