Properties connectedplanar | ||
Vertices m + n {\displaystyle m+n} Edges m + n {\displaystyle m+n} Girth m {\displaystyle m} Notation T m , n {\displaystyle T_{m,n}} | ||
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.
References
Tadpole graph Wikipedia(Text) CC BY-SA