GATE CSE
First time here? Checkout the FAQ!
x
0 votes
46 views

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 (889 points)   | 46 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 Jan 2017
  1. Debashish Deka

    9660 Points

  2. sudsho

    5554 Points

  3. Bikram

    5280 Points

  4. Habibkhan

    4878 Points

  5. Vijay Thakur

    4498 Points

  6. Arjun

    4418 Points

  7. saurabh rai

    4236 Points

  8. Sushant Gokhale

    4140 Points

  9. Kapil

    3848 Points

  10. santhoshdevulapally

    3808 Points

Monthly Topper: Rs. 500 gift card

19,443 questions
24,221 answers
53,872 comments
20,372 users