GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
52 views

asked in Graph Theory by Junior (795 points)   | 52 views
Consider loop as self-loop. That is an edge connecting a vertex to itself.

1 Answer

+1 vote
Best answer

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

 

answered by Loyal (3.3k points)  
selected by

Related questions

Top Users Feb 2017
  1. Arjun

    5386 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,021 answers
59,689 comments
22,131 users