TOPICS
Search

Lollipop Graph


LollipopGraph

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in the Wolfram Language as GraphData[{"Lollipop", {m, n}}].

Lollipop graphs are geodetic.


See also

Barbell Graph, Kayak Paddle Graph, Pan Graph, Tadpole Graph

Explore with Wolfram|Alpha

References

Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.

Referenced on Wolfram|Alpha

Lollipop Graph

Cite this as:

Weisstein, Eric W. "Lollipop Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LollipopGraph.html

Subject classifications