Computer Sciences > GATE 2014 SET-3 > Graphs
If G is a forest with n vertices and k connected components, how many edges does G have?
A
⌊n/k⌋
B
⌈n/k⌉
C
n - k
D
n - k + 1

Correct : c

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......