Answer to Question #345445 in Discrete Mathematics for jessadel

Question

1.    We define a forest to be a graph with no cycles.

 

a)    Explain why this is a good name. That is, explain why a forest is a union of trees.

b)   Suppose FF is a forest consisting of mm trees and v vertices. How many edges does FF have? Explain.

c)    Prove that any graph GG with v vertices and e edges that satisfies v<e+1 must contain a cycle (i.e., not be a forest).

Answer 1

It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order