∆ Определение 7.

A connected graph is called a tree if it contains no cycles.