The Gateway to Computer Science Excellence
+1 vote
50 views
If G is a complete bipartite graph with n vertices(n>=2) and minimum number of edges then matching no of G is_
in Mathematical Logic by (163 points) | 50 views
0
got it ...MATCHING NO=1

Please log in or register to answer this question.

No related questions found

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,493 answers
195,478 comments
100,785 users