519 views

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
407
407 views
Avik Debnath asked May 15, 2025
407 views
 In the lecture, these pair of graphs were stated to be isomorphic. My doubt is that in the first graph, left side, we can create a 5 vertex cycle, while we cannot do the...
0 0 votes
2 answers 2 answers
1.3k
1.3k views
yuuchan asked Jul 22, 2023
1,297 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⌉
3 3 votes
5 5 answers
5.5k
5.5k views
admin asked Feb 10, 2020
5,479 views
Which of the following graphs are bipartite?Only $(1)$Only $(2)$Only $(2)$ and $(3)$None of $(1),(2),(3)$All of $(1),(2),(3)$