Question: Consider a digraph G=(V,E) with at least two nodes. Prove that the following statements are equivalent: (i) G has a globally reachable node, and (ii)

Consider a digraph G=(V,E) with at least two nodes. Prove that the following statements are equivalent: (i) G has a globally reachable node, and (ii) for every pair S1,S2 of non-empty disjoint subsets of V, there exists a node that is an out-neighbor of S1 or S2 Hint: Use induction on the number of nodes in V. Please use clear and readable handwriting
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
