1 votes 1 votes If G is a complete bipartite graph with n vertices(n>=2) and minimum number of edges then matching no of G is_ jay patidar asked Jan 25, 2018 jay patidar 181 views answer comment Share Follow See 1 comment See all 1 1 comment reply jay patidar commented Jan 25, 2018 reply Follow Share got it ...MATCHING NO=1 0 votes 0 votes Please log in or register to add a comment.
