![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/d/d4/4x4_grid_spanning_tree.svg/640px-4x4_grid_spanning_tree.svg.png&w=640&q=50)
Spanning tree
Tree which includes all vertices of a graph / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Spanning tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
For the network protocol, see Spanning Tree Protocol. For other uses, see Spanning tree (disambiguation).
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G.[1] In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/d/d4/4x4_grid_spanning_tree.svg/220px-4x4_grid_spanning_tree.svg.png)