in Graph Theory edited by
355 views
1 vote
1 vote

my answer is C

but the answer given is A

someone please explain

in Graph Theory edited by
355 views

1 comment

Follow definition of Maching, 

0
0

1 Answer

2 votes
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;

1 comment

Got it sir

thankx
0
0