GATEverse Practice, past papers & mock tests
GATE 2017 · CS2 - Afternoon
Engineering MathematicsGraph TheoryeasyNAT1 mark
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 _______
Save your progress

Related Engineering Mathematics PYQs