Let G = (V, E) be a loop-free undirected graph with |V| = n. Prove that G

Question:

Let G = (V, E) be a loop-free undirected graph with |V| = n. Prove that G is a tree if and only if P(G, λ) = λ(λ - 1)n-1.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: