Discrete Mathematics with Graph Theory (3rd Edition) 295

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

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

View Full Document Right Arrow Icon
Section 11.1 293 Initial values of d( i, j) After k = 1 VI V2 V3 V4 V5 V6 V7 Vs V9 0 5 2 4 10 00 00 00 00 VI 0 5 2 4 10 00 00 00 00 5 0 7 8 15 00 00 00 00 V2 5 0 00 8 00 00 00 00 00 2 7 0 6 7 5 00 00 00 V3 2 00 0 00 7 5 00 00 00 4 8 6 0 6 00 2 00 00 4 8 0 6 2 ---+ V4 00 00 00 00 10 15 7 6 0 3 2 3 00 V5 10 00 7 6 0 3 2 3 00 00 00 5 00 3 0 00 2 4 V6 00 00 5 00 3 0 00 2 4 00 00 00 2 2 00 0 3 00 V7 00 00 00 2 2 00 0 3 00 00 00 00 00 3 2 3 0 5 Vs 00 00 00 00 3 2 3 ' 0 5 00 00 00 00 00 4 00 5 0 V9 00 00 00 00 00 4 00 5 0 After k = 3 Afterk = 5 0 5 2 4 9 7 00 00 00 0 5 2 4 9 7 6 12 00 5 0 7 8 14 12 00 00 00 5 0 7 8 14 12 10 17 00 2 7 0 6 7 5 00 00 00 2 7 0 6 7 5 8 10 00 ---+ 4 8 6 0 6 11 2 00 00 ---+ 4 8 6 0
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6 9 2 9 00 9 14 7 6 0 3 2 3 00 9 14 7 6 0 3 2 3 00 7 12 5 11 3 0 00 2 4 7 12 5 9 3 0 5 2 4 00 00 00 2 2 00 0 3 00 6 10 8 2 2 5 0 3 00 00 00 00 00 3 2 3 0 5 12 17 10 9 3 2 3 0 5 00 00 00 00 00 4 00 5 0 00 00 00 00 00 4 00 5 0 After k = 9 0 5 2 4 8 7 6 9 11 5 0 7 8 12 12 10 13 16 2 7 0 6 7 5 8 7 9 ---+ 4 8 6 0 4 7 2 5 10 8 12 7 4 0 3 2 3 7 7 12 5 7 3 0 5 2 4 6 10 8 2 2 5 0 3 8 9 13 7 5 3 2 3 0 5 11 16 9 10 7 4 8 5 0 FIGURE 2: Solution to Review Exercise 27, Chapter 10 Exercises 11.1 I. (a) [BB] ffi (b) HE (c) ~ (d) ~ (e) and (f) In each of these graphs, there are (e) @ (f) four pairs of odd vertices, so the best we can possibly do is to duplicate four edges. In each case, we show such a pseudograph....
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