This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4 7 10 4 7 10 (d) The final backtracking is 7,6,4,1. There is no spanning tree. The graph is not connected. ~: 6 7 ~ 2. (a) [BB] The final backtracking is 16, 15, 14, 13, 12, 11, 6, 5, 4, 3, 2, 1. (b) The final backtracking is 17, 16, 15, 14,1. 1 1 3 10 5 11 8 5 6 2 11 9 13 12...
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details