Tadpole graph

Tadpole graph
A (5, 3) tadpole graph.
Vertices	[math]\displaystyle{ m+n }[/math]
Edges	[math]\displaystyle{ m+n }[/math]
Girth	[math]\displaystyle{ m }[/math]
Properties	connected planar
Notation	[math]\displaystyle{ T_{m,n} }[/math]
Table of graphs and parameters

In the mathematical discipline of graph theory, the (m,n)-tadpole graph is a special type of graph consisting of a cycle graph on m (at least 3) vertices and a path graph on n vertices, connected with a bridge.

See also

• Barbell graph
• Lollipop graph