286 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
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⌉
1 votes
1 votes
1 answer
2
Shankar Kakde asked Jan 24, 2019
323 views
0 votes
0 votes
0 answers
3
Na462 asked Jan 19, 2019
567 views
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
3 votes
3 votes
3 answers
4
kapilbk1996 asked Feb 2, 2018
4,167 views
How to approach such questions ? Please provide detailed solution. Answer given is option C