Thank you @ASNR1010! :)

Dark Mode

13,421 views

70 votes

Best answer

G is an undirected graph with n vertices and 25 edges such that each vertex of G has degree **at most 3**. Then the **minimum **possible value of n is ?

If question like this then below is answer.

Let, Max degree M=3

2e/n <= M

2(25)/n <= 3

50/3 <= n

16.6666 <= n

Here n can not be 16 or less.

So, n>=17.

So, minimum n possible is 17.

1

@rajankakaniya I didn’t get the concept of ceil and floor here, Can you please explain it a bit more?

0