Tadpole graph
| Tadpole graph | |
|---|---|
 A (5, 3) tadpole graph. | |
| Vertices | |
| Edges | |
| Girth | |
| Properties | connected planar |
| Notation | |
| 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]
See also
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.
.svg?lang=en){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |