Post a New Question

math

posted by 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.

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question