Tadpole graph

{{one source |date=April 2024}}

{{infobox graph

| name = Tadpole graph

| vertices = $m+n$

| edges = $m+n$

| girth = $m$

| notation = $T\_\{m,n\}$

| properties = connected
planar

| image = Tadpole Graph.png

| image_caption = A (5,3)-tadpole graph.

}}

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.{{cite journal|last1=DeMaio|first1=Joe|last2=Jacobson|first2=John|title=Fibonacci number of the tadpole graph|journal=Electronic Journal of Graph Theory and Applications|date=2014|volume=2|issue=2|pages=129–138|doi=10.5614/ejgta.2014.2.2.5|doi-access=free}}