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?