The rattle graph is the union of two graphs. The rattle or bulb part of the graph is simply an ncycle. This n cycle is joined to a stem or handle of a rattle of length k, so the second piece is just a path graph on k vertices.

The object rattleGraph is a method function.