Question

If a graph has 10 vertices, how many edges must it have in order to be a tree?

Answer 1

`9\ edges`

Explanation:

we know that

A tree with n vertices has (n−1) edges

In this problem we have

`n=10\ vertices`

so

The number of edges is

`(n-1)=10-1=9\ edges`