n, an integer, n determines the amount of vertices for the bulb or rattle part of the graph
k, an integer, k determines the length of the stem coming out of the rattle part of the graph
Outputs:
G, an object of class Graph (missing documentation)
Description
The rattle graph is the union of two graphs. The rattle or bulb part of the graph is simply an n-cycle. 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.