Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 37: | Line 37: | ||
negative, this degree sequence is not possible.</li> | negative, this degree sequence is not possible.</li> | ||
</ol> | </ol> | ||
− | Since (II) comes only in option <b>(A)</b> and <b>(D)</b>, and since <b>(A)</b> contains I, which is correct degree | + | Since '''(II)''' comes only in option <b>(A)</b> and <b>(D)</b>, and since <b>(A)</b> contains '''I''', which is correct degree |
sequence, <b>(D)</b> must be right answer. We don't need to check for other sequences. | sequence, <b>(D)</b> must be right answer. We don't need to check for other sequences. | ||
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
This can be solved using havel hakimi theorem, which says :
So, we check each degree sequence given in question :
Since (II) comes only in option (A) and (D), and since (A) contains I, which is correct degree sequence, (D) must be right answer. We don't need to check for other sequences.
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
This can be solved using havel hakimi theorem, which says :
So, we check each degree sequence given in question :
Since (II) comes only in option (A) and (D), and since (A) contains I, which is correct degree sequence, (D) must be right answer. We don't need to check for other sequences.