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