WEEK 11

TREES

CS-6105 Discrete Mathematics

WEEK 11 : TREES
Module Learning Outcomes:

By the end of this module, a student is able to:

1. Define trees and understand its properties.
2. Understand rooted trees and spanning trees.
3. Interpret a tree and its properties.
Topics Covered

• Trees
- Trees Definition
- Properties of Tree
TREES
- Rooted and spanning trees
Trees
Properties of Trees
Proposition 4.2.1 A graph T is a tree if and only if between every pair of distinct vertices of T
there is a unique path.
Properties of Trees

Corollary 4.2.2 A graph F is a forest if and only if between any pair of vertices in F there is at
most one path.

We do not give a proof of the corollary (it is, after all, supposed to follow directly from the
proposition) but for practice, you are asked to give a careful proof in the exercises. When you
do so, try to use proof by contrapositive instead of proof by contradiction.

Our second proposition tells us that all trees have leaves: vertices of degree one.
Properties of Trees
Properties of Trees
Rooted Trees
Spanning Trees
END