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
Get step-by-step solutions from verified subject matter experts
