1,474 views
1 votes
1 votes
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of all the chosen edges, and let L = M ∪ T. Which of the following option is TRUE?
A
L is always an edge cover of G.
B
L is always a minimum edge cover of G.
C
Both (A) and (B)
D
Neither (A) nor (B)

 

Can anyone pls help solving this?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
atul_21 asked Dec 21, 2017
509 views
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
0 votes
0 votes
0 answers
4
Jaspreet Kaur Bains asked Dec 19, 2017
1,689 views
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.