= Two-component spanning forest
{title2=$|F|=|V|-2$}
A <two-component spanning forest> of a finite connected <graph> is an acyclic spanning subgraph with exactly two <connected components of a graph>. It has $|V|-2$ <edges>. For distinct terminals $a,z$, a separating two-component forest places them in different components. Deleting an <edge> of the $a$-to-$z$ <graph path> of a <spanning tree> produces such a forest; adjoining any original <edge> across its cut reverses this operation. This is the counting correspondence behind the <mean spanning-tree path current>.
Back to article page
