Let G be a simple graph with n vertices. Show that a) G is a tree if

Question:

Let G be a simple graph with n vertices. Show that
a) G is a tree if and only if it is connected and has n - 1 edges.
b) G is a tree if and only if G has no simple circuits and has n − 1 edges.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: