Spanning Trees

Let G1 = ? V1, E1 ? be a graph, and let G2 = ? V2, E2 ? be a subgraph of G1 such that G2 is a tree and V2 = V1..

Then G2 is a spanning tree for G1.

c

a

b

d

c

a

b

d

Previous slide

Next slide

Back to first slide

View graphic version