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]
This article relies largely or entirely on a single source. (April 2024) |
See also
- Barbell graph
- Lollipop graph
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.