# windmillGraph -- Constructs a windmill graph

## Synopsis

• Usage:
G = windmillGraph(k,d)
• Inputs:
• Outputs:
• G, an instance of the type Graph, The windmill graph constructed by joining d copies of the complete graph K_k at a shared vertex.

## Description

A whidmill joins d amount of copies of a complete graph on k vertices at exactly one shared vertex.

 i1 : G = windmillGraph(4,5) o1 = Graph{0 => {1, 4, 7, 10, 13, 2, 5, 8, 11, 14, 3, 6, 9, 12, 15}} 1 => {0, 2, 3} 2 => {0, 1, 3} 3 => {0, 1, 2} 4 => {0, 5, 6} 5 => {0, 4, 6} 6 => {0, 4, 5} 7 => {0, 8, 9} 8 => {0, 7, 9} 9 => {0, 7, 8} 10 => {0, 11, 12} 11 => {0, 10, 12} 12 => {0, 10, 11} 13 => {0, 14, 15} 14 => {0, 13, 15} 15 => {0, 13, 14} o1 : Graph