Register

UGC NET CSE | June 2013 | Part 2 | Question: 38

3,627 views

1 Answer

5 votes
5 votes
For an spanning forest of a graph with N vertices and C connected components, No of edges should be E=(N-C), but the given graph contains M edges .. So to have spanning forest no of edges to be removed = M- (N-C)
= M - N + C

Ans - Option C
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 14, 2016
2,271 views
UGC NET CSE | June 2013 | Part 2 | Question: 45
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as handoff mobile switching mobile routing cell switching
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known ashand...
User Avatar
3 votes
3 votes
2 answers
2
go_editor asked Jul 14, 2016
4,076 views
UGC NET CSE | June 2013 | Part 2 | Question: 43
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form? -42 -22 -21 -106
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?-42-22-21-106
User Avatar
2 votes
2 votes
1 answer
3
go_editor asked Jul 13, 2016
759 views
UGC NET CSE | June 2013 | Part 2 | Question: 5
Cyclometric complexity of a flow graph G with n vertices and e edges is V(G) = e+n-2 V(G) = e-n+2 V(G) = e+n+2 V(G) = e-n-2
Cyclometric complexity of a flow graph G with n vertices and e edges isV(G) = e+n-2V(G) = e-n+2V(G) = e+n+2V(G) = e-n-2
User Avatar
3 votes
3 votes
3 answers
4
shivani2010 asked Jun 12, 2016
4,662 views
UGC NET CSE | June 2013 | Part 2 | Question: 37
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
User Avatar
Link Copied!