Unformatted text preview: , 3 . (b). Determine the BFS tree of K 3 , 3 . problem C: True or False? If true, give a short proof. If false, give a counterexample: (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....
View
Full Document
 Spring '11
 Estie
 Planar graph, BFS tree, internal nodes

Click to edit the document details