engineering recuitment ISRO Scientist Computer Science Mock Test Engineering Mathematics Graph Theory Graphs
If G is a forest with n vertices and k connected components, how many edges does G have?
1
⌈ n/k ⌉
2
⌊ n/k ⌋
3
n - k
4
n – k + 1
⌈ n/k ⌉
⌊ n/k ⌋