Unformatted text preview: CD vI=A~~a=E ~ vii) (b) Both edges incident with vertices E, F, G and H must be in any circuit, that is, AE, DE, BF, DF, AG, DG, GH andDH. Vertices B andG appear only once among these edges, so if they are to be part of a circuit, additional edges incident with B and G must appear. The most economical way to do this is simply to add edge BG, of weight 2, obtaining the circuit AEDFBGHDGA of total weight 25. (c) No! For instance, ABGH DF DEDGA provides a route of length 23....
View Full Document
- Summer '10
- Graph Theory, @, Shortest path problem, Glossary of graph theory, shortest path