How to prove the graph is a tree

50 Views Asked by At

A graph H=(V,E) has 10 vertices and 12 edges.is it a tree? Give a reason. Justify your reason by staying a related theorem.

1

There are 1 best solutions below

0
On

No, if a tree has $v$ vertices, then it has $v-1$ edges. $12 \neq 10-1$, so it is not a tree.