The degree sequence of a simple graph is the sequence of the degrees of the…
GATE · 2010 · CS · Computer Science & IT
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?
I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2
III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1
- A.
I and II
- B.
III and IV
- C.
IV only
- D.
II and IV
Attempted by 278 students.
Sign up free to check your answer
Sign up freeLoading lesson…