A tree T has 8 vertices, at least two of which have degree 3.
a) How many edges are there?
b) What are the possible vertex degrees for T in non–increasing order?
c) What are the possible forms for T up to isomorphism?
The answer to part a is "7" while the answer to part be is " 3,3,3,1,1,1,1,1 and 3,3,2,2,1,1,1,1"
There are six possible answers for part c. how? and what are the answers?
Get Answers For Free
Most questions answered within 1 hours.