in Graph Theory
880 views
1 vote
1 vote
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?

in Graph Theory
880 views

4 Comments

choose an edge incident to v. Let T be the set of all the chosen edges,

is it mean, only choose one among all edges which are incident on v ?

if yes, then option C is correct !

Unfortunately i am thinking NO

0
0

yes it means to choose one edge among all the edges incident on v..then option c should be correct right?

0
0
then c is right !
0
0

Please log in or register to answer this question.