Let G be a simple undirected graph such that G contains only vertex 'u' of maximum degree and let D be a DFS tree of G such that D contains only vertex 'v' of maximum degree. Which of the following is True?
|
[ A ] |
'u' is same as 'v' always
|
|
[ B ] |
'u' is same as 'v' sometimes, but not always.
|
|
[ C ] |
Degree of 'u' in G is same as degree of 'v' in G
|
|
[ D ] |
None of the above
|
I don't understand this. Isn't 'u' is same as 'v' supposed to mean that both the graph and the dfs tree have the same vertex set. And I imagine the graph to be a single vertex with multiple self loops, hence having a degree of 2n. But the dfs tree should have just one vertex with a single self loop in this case, right?