The lollipop graph on 2k 1 vertices is defined as follows: a complete graph on k vertices

The lollipop graph on 2k ˆ’1 vertices is defined as follows: a complete graph on k vertices is joined with a path on k vertices by identifying one of the

endpoints of the path with one of the vertices of the complete graph (see Fig 10.14). Find the limiting distribution for simple random walk on the lollipop graph.

Transcribed Image Text:

FIGURE 10.14: Lollipop graph on nine vertices. 2. FIGURE 10.15: Weighted graph.