Register

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

• edited by
4,642 views

3 Answers

Best answer
10 votes
10 votes

When a graph has cycle, then it may or may not have the unique spanning tree.

Hence answer would be D) None of these. 

Because,

Each and every graph, which has been given in the list are cyclic graph. 

• selected by
User Avatar
3 votes
3 votes

Every connected graph has at least one spanning tree.

Let G be a connected graph.

If G has no cycles, then it is its own spanning tree.

If G has cycles, then on deleting one edge from each of the cycles, the graph remains connected and cycle free containing all the vertices of G.

So option D is correct.

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 13, 2016
756 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
2 votes
2 votes
1 answer
2
go_editor asked Jul 14, 2016
2,262 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
3
go_editor asked Jul 14, 2016
4,066 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
4
Sanjay Sharma asked May 7, 2016
3,608 views
UGC NET CSE | June 2013 | Part 2 | Question: 38
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? M+N-C M-N-C M-N+C M+N+C
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?M+N-CM-N-CM-N+CM+N+C
User Avatar
Link Copied!