Question: I think for part b : Trees with both edges must be paths whose other edge connects the two pairs; there are 4 choices for
I think for part b : Trees with both edges must be paths whose other edge connects the two pairs; there are 4 choices for that connecting edge: 0 1 , 0 2 , 3 1 , 3 2 01,02,31,32
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
