Gate CS-2014-3 Question Paper With Solutions

Q. 62 Let d denote the minimum degree of a vertex in a graph. For all planar graphs on
n vertices with d $ 3, which one of the following is TRUE?

Gate CS-2014-3 Question Paper With Solutions

Answer: (A)

Explanation:

Gate CS-2014-3 Question Paper With Solutions

Learn More:   Gate EC-2015 - 1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here