This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: What is its weight? ( OVER ) A F G H I B D E C A B C D E 18 47 38 71 62 56 73 49 84 65 3. The following graph represents a map of the streets of a town. Describe whether each of the following problems involves an Euler circuit or a Hamilton circuit and then write down the circuit beginning and ending at H (Eulerizing if necessary). a) There is a storm sewer at each intersection; after a storm you have to inspect each sewer to make sure that it is not clogged. b) After a storm you must inspect each street to make sure that it is not blocked by fallen branches. You may label the vertices to aid your description. H...
View Full Document
- Spring '08
- Leonhard Euler, Graph theory objects, Eulerian path, Hamiltonian path, Seven Bridges of Königsberg