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
Answer: (D)
Explanation:
Both II and IV cannot be the degree sequence of any graph.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
… [Trackback]
[…] Here you can find 43998 additional Information on that Topic: geeksforgeeks.org/data-structures-graph-question-2-2/ […]
… [Trackback]
[…] There you will find 42423 additional Information to that Topic: geeksforgeeks.org/data-structures-graph-question-2-2/ […]