0 votes 0 votes The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V is (A) < (B) (C) (D) None of the above. Mathematical Logic graph-theory + – Sarvottam Patel asked Jan 8, 2017 Sarvottam Patel 488 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Tendua commented Jan 8, 2017 reply Follow Share think c is the answer. Comment if right 0 votes 0 votes Sarvottam Patel commented Jan 9, 2017 reply Follow Share No its B they have given 0 votes 0 votes Tendua commented Jan 9, 2017 reply Follow Share 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. 0 votes 0 votes Sushant Gokhale commented Jan 10, 2017 reply Follow Share Have a look at this: Left half is disconnected graph. So, here, Md<Mc. This was from Gatebbok, right? 0 votes 0 votes Please log in or register to add a comment.