Tadpole graph - Reference.org

On this page

Vertices m + n {\displaystyle m+n}

Edges m + n {\displaystyle m+n}

Girth m {\displaystyle m}

Properties connected
planar

Notation T m , n {\displaystyle T_{m,n}}

Additional information

Tadpole graph

Type of graph consisting of a cycle graph on m vertices and a path graph on n vertices, connected with a bridge

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.

We don't have any images related to Tadpole graph yet.

You can add one yourself here.

We don't have any YouTube videos related to Tadpole graph yet.

You can add one yourself here.

We don't have any PDF documents related to Tadpole graph yet.

You can add one yourself here.

We don't have any Books related to Tadpole graph yet.

You can add one yourself here.

We don't have any archived web articles related to Tadpole graph yet.

You can submit a link to a page to archive here.

References

DeMaio, Joe; Jacobson, John (2014). "Fibonacci number of the tadpole graph". Electronic Journal of Graph Theory and Applications. 2 (2): 129–138. doi:10.5614/ejgta.2014.2.2.5. https://doi.org/10.5614%2Fejgta.2014.2.2.5 ↩

See also

References