Gate CS-2017-2 Question Paper With Solutions

Q. 27 G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is ________

(A) 4

(B) 8

(C) 16

(D) 24

Answer: (C)

Explanation:

Gate CS-2017-2 Question Paper With Solutions

Learn More:   Gate ME-2020-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here