The following are equivalent characterisations of trees and finite trees: - A tree is an undirected, simple, acyclic, connected [[Graphs|graph]]. - [[Trees are edge-minimally connected graphs]]. - [[Finite tree is a connected graph with one less edge than vertices]]. # Properties