First time here? Checkout the FAQ!
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.

asked in Mathematical Logic by Junior (929 points)   | 58 views
think c is the answer. Comment if right
No its B they have given
Then i think they have given it wrong. Take 4 vertex and make a square. No of matching is 2 while now take a disconnected graph in which no edge is there . Matching = 0. so md < mc graph. now for equal case take the same vertex set make 2 components such that each component contain 2 vertex and one edge. so now maximal matching in such a graph is 2. which is equal to the mc.

Have a look at this:

Left half is disconnected graph.

So, here, Md<Mc.

This was from Gatebbok, right?

Please log in or register to answer this question.

Top Users May 2017
  1. akash.dinkar12

    3338 Points

  2. pawan kumarln

    2066 Points

  3. Bikram

    1922 Points

  4. sh!va

    1672 Points

  5. Arjun

    1614 Points

  6. Devshree Dubey

    1272 Points

  7. Debashish Deka

    1174 Points

  8. Angkit

    1056 Points

  9. LeenSharma

    1018 Points

  10. Arunav Khare

    758 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    1008 Points

  2. pawan kumarln

    692 Points

  3. Arnab Bhadra

    628 Points

  4. Arjun

    342 Points

  5. bharti

    328 Points

22,888 questions
29,193 answers
27,691 users