Definition: Spanning Tree

A spanning subgraph, which is a tree, is called a spanning tree.

  1. Theorem: Number of Labeled Spanning Trees

Theorems: 1


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Krumke S. O., Noltemeier H.: "Graphentheoretische Konzepte und Algorithmen", Teubner, 2005, 1st Edition