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.
i1 : lollipopGraph (6,2)
o1 = Graph{0 => {1, 2, 3, 4, 5} }
1 => {0, 2, 3, 4, 5}
2 => {0, 1, 3, 4, 5}
3 => {0, 1, 2, 4, 5}
4 => {0, 1, 2, 3, 5}
5 => {0, 1, 2, 3, 4, 6}
6 => {5, 7}
7 => {6}
o1 : Graph
|
The object lollipopGraph is a method function.