Free Trees

An undirected graph is a free tree if (a) it is connected, and (b) it has no cycles.

A free tree is unrooted.

G = ? V, E ?, V = { a, b, c, d }, E = {? a, b ?, ? a, d?, ? a, c? }

c

a

b

d

Previous slide

Next slide

Back to first slide

View graphic version