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 Active (1k points)   | 67 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 Sep 2017
  1. Habibkhan

    6362 Points

  2. Warrior

    2234 Points

  3. Arjun

    2212 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1716 Points

  8. makhdoom ghaya

    1660 Points

  9. A_i_$_h

    1528 Points

  10. rishu_darkshadow

    1512 Points

25,988 questions
33,561 answers
31,026 users