An ordered n-tuple (d1,d2,...,dn)withd1≥d2,...≥dn is called graphic if there exists a simple undirected graph with n vertices having degree d1,d2,...,dn respectively. Which of the following 6-tuples is NOT graphic?
A
(1, 1, 1, 1, 1, 1)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
(2, 2, 2, 2, 2, 2)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
(3, 3, 3, 1, 0, 0)
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
(3, 2, 1, 1, 1, 0)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is C (3, 3, 3, 1, 0, 0) Use the Havell-hakimi algorithm.
The sequence of steps in the algorithm for each graph is shown below: