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?
A degree sequence $d1,d2,d2. . . dn$ of non negative integer is graphical if it is a degree sequence of a graph. We now introduce a powerful tool to determine whether a particular sequence is graphical due to Havel and Hakimi Havel–Hakimi Theorem : → According to this theorem, Let $D$ be sequence the $d1,d2,d2. . . dn$ with $d1 \geq d2 \geq d2 \geq . . . dn$ for $n \geq 2$ and $di \geq 0$. → Then $D0$ be the sequence obtained by: → Discarding $d1$, and → Subtracting $1$ from each of the next $d1$ entries of $D$. → That is Degree sequence $D0$ would be : $d2-1, d2-1, d3-1 . . . , dd1+1 -1 . . . , dn$ → Then, $D$ is graphical if and only if $D0$ is graphical. Now, we apply this theorem to given sequences:
Hence only option (I) and (III) are graphic sequence and answer is option-(D)
For this part-
"Option II) 6,6,6,6,3,3,2,2 → 5,5,5,2,2,1,2 ( arrange in ascending order) → 5,5,5,2,2,2,1 → 4,4,1,1,1,1 → 3,0,0,0,1 this type of graph can not possible so its not a graphical."
why we have 5,5,5,2,2,1,2 --> last 2 should be 1
@ Regina Phalange
in option 2) 6,6,6,6,3,3,2,2 here max degree is 6 so we apply theorem upto sixth position.
in option 1) 7,6,5,4,4,3,2,1 here max degree is 7 so we apply theorem upto seventh position..
hope u got it now .. :)
This might help ....
The answer is clearly D.
You can eliminate the last sequence i.e 4th one as... the total number of vertices is 8 and the maximum degree given is 8 too. which isn't possible at all. The maximum degree you can have out of 8 vertices is 7.
Now coming to the method for solving such questions is through Havel-Hakimi Algorithm.
you can implement it by following one simple video. Here it is. :)
D is correct ans
Gatecse
The answer to the first question is $2048 ...