Posted by **aj** on Monday, March 14, 2011 at 7:20pm.

(a). For any connected graph G, all internal nodes of the BFS tree on G have the same number of children.

(b). For any connected graph G, the DFS tree on G and the BFS tree on G have the same number of edges.

## Answer This Question

## Related Questions

- math - (a). Determine the DFS tree of K3,3. (b). Determine the BFS tree of K3,3.
- math - Problem A: Let T be a balanced 5-ary tree with 81 nodes. (a). How many ...
- Maths - A full binary tree of height 4 has 15 nodes The 8 nodes at the bottom of...
- Discrete math - please help I'm completely lost Is the following connected graph...
- physics - Two children hang by their hands from the same tree branch. The branch...
- physics - Two children hang by their hands from the same tree branch. The branch...
- physics - Two children hang by their hands from the same tree branch. The branch...
- physics - Two children hang by their hands from the same tree branch. The branch...
- physics - Two children hang by their hands from the same tree branch. The branch...
- Physics - Two children hang by their hands from the same tree branch. The branch...

More Related Questions