The Gateway to Computer Science Excellence
+1 vote
116 views

my answer is C

but the answer given is A

someone please explain

in Graph Theory by Junior (829 points)
edited by | 116 views
0

Follow definition of Maching, 

1 Answer

+1 vote

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;

by Active (2k points)
0
Got it sir

thankx
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,737 questions
57,295 answers
198,260 comments
104,970 users