lollipopGraph -- constructs a lollipop graph

• Usage:

  G = lollipopGraph (m, n)

• Inputs:
  • 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, a graph, The 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