1 votes 1 votes Graph Theory graph-theory + – firki lama asked Jan 6, 2017 firki lama 978 views answer comment Share Follow See 1 comment See all 1 1 comment reply Pratyush Madhukar commented Jan 6, 2017 reply Follow Share Consider loop as self-loop. That is an edge connecting a vertex to itself. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes 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 Pratyush Madhukar answered Jan 6, 2017 • selected Jan 7, 2017 by Sushant Gokhale Pratyush Madhukar comment Share Follow See all 0 reply Please log in or register to add a comment.