Yes in that case we can apply ceil. But, minimum vertices n will be 17 (not maximum). @neel19
@rajankakaniya
Yes in that case we can apply ceil. But, minimum vertices n will be 17 (not maximum).
How can you explain??
Right click on the user and copy link…
Like yours…
https://gateoverflow.in/user/ankit3009
Now remove the front and add ‘@’ or not
@ankit3009
Now it’s done.🙂
Thank you @ASNR1010! :)
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.
@rajankakaniya I didn’t get the concept of ceil and floor here, Can you please explain it a bit more?
64.3k questions
77.9k answers
244k comments
80.0k users