Definition:Spanning Tree/Building-Up Method

Definition

Start with the edgeless graph $N$ whose vertices correspond with those of $G$.

Select edges of $G$ one by one, such that no cycles are created, and add them to $N$.

Continue till all vertices are included.

Sources

• 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): $\S 4.1$: The Minimal Connector Problem: An Introduction to Trees