GATE Exam  >  GATE Questions  >  An ordered n-tuple (d1, d2, .... dn) with d1 ... Start Learning for Free
An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d≥ ... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?
  • a)
    (1, 1, 1, 1, 1, 1)
  • b)
    (2, 2, 2, 2, 2, 2)
  • c)
    (3, 3, 3, 1, 0, 0)
  • d)
    (3, 2, 1, 1, 1, 0)
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is...
Use the Havell-hakimi algorithm.
The sequence of steps in the algorithm for each graph is shown below:
View all questions of this test
Explore Courses for GATE exam
An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer?
Question Description
An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer?.
Solutions for An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.
Here you can find the meaning of An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer?, a detailed solution for An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?a)(1, 1, 1, 1, 1, 1)b)(2, 2, 2, 2, 2, 2)c)(3, 3, 3, 1, 0, 0)d)(3, 2, 1, 1, 1, 0)Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice GATE tests.
Explore Courses for GATE exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev