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…
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.
Named variants
Name Image Paw graph Banner graph
See also Barbell graph Lollipop graph
References
Gebaseerd op: Wikipedia — Tadpole graph · auteursgeschiedenis.
Tekst: CC BY-SA 4.0.
Wikisyntaxis en sjablonen zijn verwijderd; langere teksten zijn ingekort.