Tadpole graph

Vertices${\displaystyle m+n}$

Edges${\displaystyle m+n}$

Girth${\displaystyle m}$

Propertiesconnected
planar

Tadpole graph
A (5,3)-tadpole graph.
Vertices	${\displaystyle m+n}$
Edges	${\displaystyle m+n}$
Girth	${\displaystyle m}$
Properties	connected planar
Notation	${\displaystyle T_{m,n}}$
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.^[1][2][3]