Question: Let G be a graph with 20 vertices and 18 edges. Prove that if G contains exactly one cycle, then G has exactly 3 components

Let G be a graph with 20 vertices and 18 edges. Prove that if G contains exactly one cycle, then G has exactly 3 components such that two of them are trees.

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 Mathematics Questions!