Unformatted text preview: uv cannot disconnect the graph. 26. (a) No. For example, ~ is not strongly connected. (b) Yes. The underlying graph for a tournament is a complete graph. Since lCn is connected and has no bridges (there are always at least two paths between vertices u and v), it has a strongly connected orientation by Theorem 12.6.3. Exercises 13.1 1. (a) [BB] We draw the graph quickly as a planar graph and then, after some thinking, as a plane with straight edges. k(b) [BB] There are seven regions, numbered 1,2, ... ,7, with boundaries aJg, ghe, hbi, icd, bjc, Jedk, and ajk, respectively. (c) [BB] E = 11, V = 6, R = 7, N = 22; so V E + R = 6 11 + 7 = 2; N = 22 :::; 22 = 2E and E = 11 :::; 12 = 3V  6. 2. (a) (b) There are five regions, numbered 1,2,3,4,5, with boundaries abgJ, bchg, cdih, deji and aej f. (c) E = 10, V = 7, R = 5, N = 20; so, V E + R = 7 10 + 5 = 2, N = 20 :::; 20 = 2E and E = 10 :::; 15 = 3V  6....
View
Full Document
 Summer '10
 any
 Graph Theory, Planar graph, connected graph, strongly connected orientation, end vertex

Click to edit the document details