GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 62 of 65

Marks: +1, -0

An ordered n-tuple (d₁, d₂,…, d_n) and d₁ ≥ d₂ ≥ … ≥ d_n is called graphic if there exists a simple undirected graph with n vertices having degrees d₁, d₂,…, d_n respectively. Which of the following 6-tuples is NOT graphic?