Question: Let n be a positive integer and let Sn be any set with |Sn| = n. Define Dn to be the digraph with V (Dn)
Let n be a positive integer and let Sn be any set with |Sn| = n. Define Dn to be the digraph with V (Dn) = P(Sn), the set of all subsets of Sn, where (X, Y ) A(Dn) if and only if X contains Y properly as a subset. Prove that D has a unique source
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
