Tadpole graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Tadpole graph
A (5,3)-tadpole graph.
Verticesm+n
Edgesm+n
Girthm
Propertiesconnected
planar
NotationTm,n
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 (m,n) Image
Paw graph[4] (3,1)
Banner graph[5] (4,1)
File:Banner graph.svg

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).