2.10 Trees | 2.10 Trees | Unit 2: Structures | Mathematics for Computer Science | Electrical Engineering and Computer Science

Trees: Many Definitions

Which of the following statements is a valid definition of a tree?

a connected simple graph with no cycles

a connected simple graph in which every edge is a cut edge

a simple graph that is connected and vertex-minimal

a simple graph that is connected and edge-minimal

an edge-maximal acyclic graph

a connected simple graph with \(n \) vertices and \(n-1 \) edges

a simple graph with a unique path between any 2 vertices