G is undirected graph with n vertices and 25 edges such that

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

Coming Soon

15

M: +1.00/-0.00

G 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 _____.

[GATE CS 2017 Set 2]

A 16