edited by
479 views

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;