#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Corollary 4.2.2
Answer
A graph F is a forest if and only if between any pair of vertices in F there is at most one path
A graph F is a forest if and only if between any pair of vertices in F there is at most one path