1 votes 1 votes my answer is C but the answer given is A someone please explain Graph Theory ace-test-series graph-theory graph-matching + – ashish pal asked Jan 20, 2018 • edited Mar 3, 2019 by I_am_winner ashish pal 498 views answer comment Share Follow See 1 comment See all 1 1 comment reply Anu007 commented Jan 20, 2018 reply Follow Share Follow definition of Maching, 0 votes 0 votes Please log in or register to add a comment.
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; Neeraj Chandrakar answered Jan 20, 2018 Neeraj Chandrakar comment Share Follow See 1 comment See all 1 1 comment reply ashish pal commented Jan 20, 2018 reply Follow Share Got it sir thankx 0 votes 0 votes Please log in or register to add a comment.