Question: Let G be a digraph with n > = 2 vertices. The graph is strongly connected, and textitevery node has indegree 1 . Prove that
Let G be a digraph with n vertices. The graph is strongly connected, and
textitevery node has indegree Prove that G is the directed cycle with n vertices
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
