Lollipop graph

<h2 id="see-also">See also</h2>
<ul><li>Barbell graph</li>
<li><a href="/facts/Tadpole_graph/GaWbwSoF">Tadpole graph</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Weisstein, Eric. "Lollipop Graph". Wolfram Mathworld. Wolfram MathWorld. Retrieved 19 August 2015. <a href="http://mathworld.wolfram.com/LollipopGraph.html" target="_blank">http://mathworld.wolfram.com/LollipopGraph.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Brightwell, Graham; Winkler, Peter (September 1990). "Maximum hitting time for random walks on graphs". Random Structures & Algorithms. 1 (3): 263–276. doi:10.1002/rsa.3240010303. <a href="/wiki/Graham_Brightwell" target="_blank">/wiki/Graham_Brightwell</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Feige, Uriel (August 1995). "A tight upper bound on the cover time for random walks on graphs". Random Structures & Algorithms. 6: 51–54. CiteSeerX 10.1.1.38.1188. doi:10.1002/rsa.3240060106. <a href="/wiki/Uriel_Feige" target="_blank">/wiki/Uriel_Feige</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Jonasson, Johan (March 2000). "Lollipop graphs are extremal for commute times". Random Structures and Algorithms. 16 (2): 131–142. doi:10.1002/(SICI)1098-2418(200003)16:2<131::AID-RSA1>3.0.CO;2-3. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
</ol>

Lollipop graph open-in-new

Lollipop graph