Spanning trees of graphs

1 month ago
13

Episode 26.

Spanning trees of graphs.
Definition. A spanning tree of graph G is a subgraph that is a tree and that contains all vertices of G.
Theorem. Any connected graph has a spanning tree.

The video on YouTube:
https://youtu.be/OuckJpnhDdI

The video on Telegram:
https://t.me/mathematical_bunker/50

Loading comments...