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}}].

The (3,1)-lollipop graph is isomorphic to the paw graph. In general, the (3,n)-lollipop graph is isomorphic to the (3,n)-tadpole graph.

Special cases are summarized in the following table (where the names paw graph and banner graph appear in ISGCI).

Lollipop graphs are geodetic.


See also

Barbell Graph, Hammer Graph, Kayak Paddle Graph, Pan Graph, Paw 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.ISGCI: Information System on Graph Class Inclusions v2.0. "List of Small Graphs." http://www.graphclasses.org/smallgraphs.html.

Referenced on Wolfram|Alpha

Lollipop Graph

Cite this as:

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

Subject classifications