Discrete Mathematics with Graph Theory (3rd Edition) 283

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

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

View Full Document Right Arrow Icon
Section 10.4 2. [BB] 2 C (B, 5) ..Joit-----~ D ~-~----~~~-~ 5 3. A( -, O)~----a:::~ 4. (a) [BB] The final labeling starting at A is shown to the right. The shortest path from A to E is ABCJIGFKE and has length 13. G(A,2) (G,6) C(B,7) E(J,10)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2 D(C,5) H(A,I) 9 G(I,9) 1 F(G,10) 1C (B,4) (b) The final labeling, starting at H is shown to the right. The shortest path from H to D is HABCD and has length 6. A(H, 1) Cf--~~-=--~~--i!It;-=--:-~ E(K,13) H( -,0) 9 G(H,9) 1 F(G,10) 281...
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