In the mathematical field of graph theory [Graph theory], a spanning tree [Tree] T of an undirected graph [Graph] G is a subgraph that is a tree which includes all of the vertices [Vertices] of G.

In the mathematical field of graph theory [Graph theory], a spanning tree [Tree] T of an undirected graph [Graph] G is a subgraph that is a tree which includes all of the vertices [Vertices] of G.