Spanning Tree

graph-theory

Definition

Spanning Tree

A spanning tree $T$ of a simple undirected connected graph $G$ is a tree with $V(T)=V(T)$ and $E(T)\subseteq E(G)$, meaning $T$ contains the same vertices as $G$ and a subset of edges of $G$.