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.
How to prove the graph is a tree
0
$\begingroup$
graph-theory
trees
1 Answers
4
No, if a tree has $v$ vertices, then it has $v-1$ edges. $12 \neq 10-1$, so it is not a tree.