![GATE 2014 [Set-3]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
GATE 2014 [Set-3]
April 2, 2025GATE 2014 [Set-3]
April 3, 2025GATE 2014 [Set-3]
|
Question 61
|
If G is a forest with n vertices and k connected components, how many edges does G have?
|
⌊n/k⌋
|
|
|
⌈n/k⌉
|
|
|
n–k
|
|
|
n-k+1
|
Question 61 Explanation:
Suppose, if each vertex is a component, then k=n, then there will not be any edges among them Replace the same in options
Option 1, 2 will give answer 1. (i.e. one edge among them),
Option 3: n-k = 0 edges.
Option 4: n-k+1 = 1 edge, which is false.
Option 1, 2 will give answer 1. (i.e. one edge among them),
Option 3: n-k = 0 edges.
Option 4: n-k+1 = 1 edge, which is false.
Correct Answer: C
Question 61 Explanation:
Suppose, if each vertex is a component, then k=n, then there will not be any edges among them Replace the same in options
Option 1, 2 will give answer 1. (i.e. one edge among them),
Option 3: n-k = 0 edges.
Option 4: n-k+1 = 1 edge, which is false.
Option 1, 2 will give answer 1. (i.e. one edge among them),
Option 3: n-k = 0 edges.
Option 4: n-k+1 = 1 edge, which is false.