Question: A graph is called a 1-cycle graph if it contains exactly one cycle. Show that every connected 1-cycle graph of order n has size n.
A graph is called a 1-cycle graph if it contains exactly one cycle. Show that every connected 1-cycle graph of order n has size n.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
