Question

Let be an undirected graph with vertices and 25 edges such that each vertex
of has degree at least 3. Then the maximum possible value of is

Answer 1

${\huge{\pink{↬}}} \: \: {\huge{\underline{\boxed{\bf{\pink{Answer}}}}}}$

Let v be number of vertices in graph. This discussion on G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3.

Then the maximum possible value of n is ________

a)4

b)8

c)16

d)24

Correct answer is option 'C'.