Question: (a) Determine whether the degree sequence S = (3, 2, 2, 1, 1, 1) is graphical or not by use of Havel- Hakimi theorem (b)
(a) Determine whether the degree sequence S = (3, 2, 2, 1, 1, 1) is graphical or not by use of Havel- Hakimi theorem
(b) Construct a Tree from a Prufer code (2, 2, 1, 1, 3)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
