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

asked in Graph Theory by Junior (877 points)   | 64 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.4k points)  
selected by

Related questions



Top Users Apr 2017
  1. akash.dinkar12

    3796 Points

  2. Divya Bharti

    2716 Points

  3. Deepthi_ts

    2294 Points

  4. rude

    2142 Points

  5. Tesla!

    1888 Points

  6. Kapil

    1786 Points

  7. Sanjay Sharma

    1702 Points

  8. Debashish Deka

    1690 Points

  9. Prashant.

    1672 Points

  10. Arjun

    1614 Points

Monthly Topper: Rs. 500 gift card

22,149 questions
28,146 answers
63,542 comments
24,309 users