Prove that if (G) is an undirected tree with more than one vertex, then (G) contains at

Question:

Prove that if \(G\) is an undirected tree with more than one vertex, then \(G\) contains at least two vertices of degree 1 .

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: