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
3796 Points
2716 Points
2294 Points
2142 Points
1888 Points
1786 Points
1702 Points
1690 Points
1672 Points
1614 Points
Gatecse
@Uzumaki
There are some previous years ...