606 views

1 Answer

Related questions

2 votes
2 votes
1 answer
2
0 votes
0 votes
2 answers
3
yuuchan asked Jul 22, 2023
475 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⌉
0 votes
0 votes
0 answers
4
Isha Gupta asked Jun 12, 2016
1,109 views