411 views
3 votes
3 votes

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
Parshu gate asked Nov 28, 2017
601 views
0 votes
0 votes
2 answers
2
0 votes
0 votes
2 answers
3
yuuchan asked Jul 22, 2023
477 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉