Discrete Mathematics with Graph Theory (3rd Edition) 350

Discrete Mathematics with Graph Theory (3rd Edition) 350 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
348 Solutions to Exercises Exercises 12.5 1. (a) [BB] The final backtracking is 7, 2, 1. bA 5417 5417 (b) The final backtracking is 14, 11, 10,9, 8, 7, 6, 5,4, 3, 2, 1. 13 12 13 12 2 G---=--iII----e-""--~ 8 2 8 4 6 4 6 (c) The final backtracking is 10,9,8,6,5,1 2 5 9 2 5 9 3~ 3~
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online