Graph Algorithm 10

0. Let T be a depth first search tree in a undirected graph G. Vertices-u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. Which one of the following statements is true?

Answer
Comment
Array

Option : D
Explanation :

For the above graph, conducting depth First scarch:
Stack : A
Stack : DBC Tree : A
Stack : EBC Tree : A / D
Stack : BC Tree : A / D / E
Stack : BC
Stack : Φ Tree :

Considering l eaf nodes E and C, t he gi ven condition is satisfied as their degrees are more than one. But none of (A), (B) or (C) hold.
But a cycle consisting of E and all its neighbour hold.

Forgot your password?

I agree with the Terms.