m, an integer, The number of vertices in the complete graph element
n, an integer, The length of stem coming out of the complete graph element
Outputs:
G, an object of class Graph (missing documentation), The lollipop graph
Description
A lollipop graph is a graph that is the union of two major elements. The "candy" portion is a complete graph of size m. Coming out of this is the stick or stem, just a path graph of size n. The combination of these yields a lollipop graph.