Gate2017 ss Q15

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

Note – Numerical Type question

Option : D
Explanation :
If every vertex has degree at least k then

Forgot your password?

I agree with the Terms.