#CS-6105
Awesome StudentQuestion • Discrete Mathematics

A graph F is a ___if and only if between any pair of vertices in F there is at most ___

Answer

forest - one path