952 views

1 Answer

Best answer
2 votes
2 votes

Loop implies self loop. Check the following link for difference between a loop and a cycle:

http://math.stackexchange.com/questions/1490053/what-is-the-difference-between-a-loop-cycle-and-strongly-connected-components-i

Answer should be B.

Graph will have to contain a cycle so that every vertex has degree >= 2.

Graph may not be connected, because there may be two components in the graph, each having a cycle so that each of the vertices may have degree >=2

selected by

Related questions

0 votes
0 votes
2 answers
1
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⌉