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]

This graph theory-related article is a stub.

You can help Wikipedia by expanding it.