Question: a. Prove that a forest with c components and n vertices has n - c edges. Assume n c. (Hint: the base case will have

a. Prove that a forest with c components and n vertices has n - c edges. Assume n c. (Hint: the base case will have n = c.)

b. Use the fact proven in the previous problem to show that if a graph has no cycles and has at least n - 1 edges then the graph must be connected.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!