472 views
0 votes
0 votes

The relation between size of a maximum matching M_{d} in a disconnected graph G on vertex set V and the size of a maximum matching M_{c} of a connected graph G on same vertex set V is

(A) M_{d} < M_{c}

(B) M_{d} =M_{c}

(C)M_{c} \geqM_{d} 

(D) None of the above.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
Sahil_Lather asked Jan 27, 2023
354 views
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
0 votes
0 votes
0 answers
2
Sahil_Lather asked Jan 27, 2023
487 views
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
0 votes
0 votes
0 answers
3
Sahil_Lather asked Jan 27, 2023
195 views
If [P(A); ⊆] is a lattice where A = {x, y} and P(A) is the power set then what is the sum of element in Greatest Lower Bound (GLB) set of given lattice?x + y xy0