We have an undirected graph G = (V, E) with m = |E| and n =...

 

Transcribed Image Text:

We have an undirected graph G = (V, E) with m = |E| and n = |V|. Let (x, y) be an edge in G. What is correct about the following statement? If T is a BFS tree of G, then the level of x and y differ by exactly 1. If G is connected and has n edges (i.e. m=n), then G contains exactly 1 cycle. ○ If T is a DFS tree of G, then the level of x and y differ by at most 1. We have an undirected graph G = (V, E) with m = |E| and n = |V|. Let (x, y) be an edge in G. What is correct about the following statement? If T is a BFS tree of G, then the level of x and y differ by exactly 1. If G is connected and has n edges (i.e. m=n), then G contains exactly 1 cycle. ○ If T is a DFS tree of G, then the level of x and y differ by at most 1.

Answer rating: 100% (QA)

Lets analyze each statement to determine which ones are correct 1 If T is a BFS tree of G then the l... View the full answer