An ordered \(n\)−tuple \((d_1, d_2,\ldots,d_n)\) with \(d_1 \geq d_2 \geq…

GATE · 2014 · CS · Set 1 · Computer Science & IT

An ordered nn−tuple (d1,d2,…,dn)(d_1, d_2,\ldots,d_n) with d1≥d2≥…≥dnd_1 \geq d_2 \geq \ldots \geq d_n is called graphic  if there exists a simple undirected graph with nn vertices having degrees d1,d2,…,dnd_1,d_2,\ldots,d_n  respectively. Which one of the following 6-tuples is NOT graphic?

  1. A.

    (1, 1, 1, 1, 1, 1)

  2. B.

    (2, 2, 2, 2, 2, 2)

  3. C.

    (3, 3, 3, 1, 0, 0)

  4. D.

    (3, 2, 1, 1, 1, 0)

Attempted by 354 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…