Ononot — If a graph has n vertices and n-1 edges and is connected, it

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryhard

0:00.0

If a graph has $n$ vertices and $n-1$ edges and is connected, it is a: