Tadpole graph
Jump to navigation
Jump to search
| 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][2][3]
Named variants
[edit | edit source]| Name | Image | |
|---|---|---|
| Paw graph[4] |
| |
| Banner graph[5] |
|
See also
[edit | edit source]- Barbell graph
- Lollipop graph
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
