This preview shows page 1. Sign up to view the full content.
Unformatted text preview: adjacent to A so the graph is not Hamiltonian. (Alternatively, vertices C and G of degree 2 impose a proper circuit.) A B F D D Gee G 325 F G C B B C G (c) Since there are Hamiltonian paths from A, we seek a paving of roads which allows us to visit every town with paved roads from A. To do this at minimal cost, we should pave the roads along the Hamiltonian path ADEFCBG at a cost of 15. This path is the best of the Hamiltonian paths,...
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