Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2003 | Question 40

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

A graph G = (V, E) satisfies |E| ≤ 3 |V| – 6. The min-degree of G is defined as GATECS2003Q40. Therefore, min-degree of G cannot be
(A) 3
(B) 4
(C) 5
(D) 6

Answer: (D)


Let the min-degree of G be x, then G has at least |v| *x/2 edges.

|v|*x/2 <= 3* |v| -6

for x=6, we get 0 <= -6, Therefore, min degree of G cannot be 6.

Hence answer is (D).

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!