Question: Prove the theorem a # A loopless digraph has an indpendent sets such that each vertex of not in s is reachable from a resten
Prove the theorem 
a # A loopless digraph has an indpendent sets such that each vertex of not in s is reachable from a resten ins by directed path of length at most two
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
