search
Log In
1 vote
183 views

my answer is C

but the answer given is A

someone please explain

in Graph Theory
edited by
183 views
0

Follow definition of Maching, 

1 Answer

2 votes

a complete bipartite graph with minimum no of edges hence Kn-1,1

total vertices (n-1+1)=n

total edges=(n-1)*1=n-1(it is minimum)

hence matching no is =min(n-1,1)=1;

0
Got it sir

thankx
...