GATE Computer Science (CS) 2017 Shift 2 Solved Paper

Question : 33 of 65

Marks: +1, -0

G is an 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 ______.