# math

posted by
**aj** on
.

(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.