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

asked in Graph Theory by Junior (927 points)   | 79 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 Aug 2017
  1. ABKUNDAN

    4654 Points

  2. Bikram

    4012 Points

  3. akash.dinkar12

    3136 Points

  4. rahul sharma 5

    2832 Points

  5. manu00x

    2644 Points

  6. makhdoom ghaya

    2370 Points

  7. just_bhavana

    2040 Points

  8. Tesla!

    1742 Points

  9. pawan kumarln

    1574 Points

  10. learner_geek

    1554 Points


24,864 questions
31,941 answers
74,060 comments
30,062 users