Tadpole graph

From Wikipedia, the free encyclopedia

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]

Quick Facts Vertices, Edges ...
Tadpole graph
A (5, 3) tadpole graph.
Vertices
Edges
Girth
Propertiesconnected
planar
Notation
Table of graphs and parameters
Close

See also

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.