GATEverse
← GATE CSE 2014 Set 1

Q52

MCQ2 marks, −0.67

An ordered n−n-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 66-tuples is NOT graphic?

Sign in to save attempts.

Loading…