Ace Test Series: Graph Theory - Matching

Question

my answer is C

but the answer given is A

someone please explain

Comments

Follow definition of Maching, 

Answer 1

a complete bipartite graph with minimum no of edges hence K_n-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;

Comments

Got it sir

thankx