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

asked in Graph Theory by Active (1.1k points) 1 21 47 | 94 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 (4k points) 6 12 27
selected by

Related questions

+1 vote
2 answers
2
asked in Graph Theory by shivani2010 Active (1.7k points) 4 34 52 | 402 views
–1 vote
1 answer
3
asked in Graph Theory by Hira Thakur Boss (8.3k points) 6 41 121 | 426 views


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23642 Points

  2. Bikram

    17188 Points

  3. Habibkhan

    8734 Points

  4. srestha

    6404 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5098 Points

  7. Sachin Mittal 1

    4882 Points

  8. joshi_nitish

    4478 Points

  9. sushmita

    4008 Points

  10. Rishi yadav

    3960 Points


Recent Badges

Popular Question Bikram
Regular Mr.OOPs
Avid Reader Venkat Sai
Popular Question jothee
Verified Human anchal Singh
Great Question Kathleen
Verified Human Ankita_ Pawar
Avid Reader kenzou
Notable Question Sumit Chaudhary 2
Nice Comment rahul sharma 5
27,380 questions
35,231 answers
84,395 comments
33,389 users