Graph Theory - Ankur · PDF fileGraph Theory Author: CamScanner Subject: Graph Theory
Chap. 11 Graph Theory and Applications
description
Transcript of Chap. 11 Graph Theory and Applications
![Page 1: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/1.jpg)
Chap. 11 Graph Theory and Applications
1
![Page 2: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/2.jpg)
Directed Graph
2
![Page 3: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/3.jpg)
(Undirected) Graph
3
![Page 4: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/4.jpg)
Vertex and Edge Sets
4
![Page 5: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/5.jpg)
Walk
5
![Page 6: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/6.jpg)
Closed (Open) Walk
6
![Page 7: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/7.jpg)
Trail, Path, Circuit, and Cycle
7
![Page 8: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/8.jpg)
Comparison of Walk, Trail, Path, Circuit, and Cycle
8
![Page 9: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/9.jpg)
Theorem 11.1
Observation:
9
![Page 10: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/10.jpg)
Theorem 11.1
1. It suffices to show from a to b, the shortest trail is the shortest path.2. Let be the shortest trail
from a to b.3.
4. 10
![Page 11: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/11.jpg)
Connected Graph
connected graph disconnected graph11
![Page 12: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/12.jpg)
Multigraph
12
![Page 13: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/13.jpg)
Subgraph
13
![Page 14: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/14.jpg)
Spanning Subgraph
14
![Page 15: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/15.jpg)
Induced Subgraph
15
![Page 16: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/16.jpg)
Which of the following is an induced subgraph of G? O
Induced Subgraph
O X
16
![Page 17: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/17.jpg)
Components of a Graph
1 2
connected sugraph
17
![Page 18: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/18.jpg)
G-v
18
![Page 19: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/19.jpg)
G-e
19
![Page 20: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/20.jpg)
Complete Graph
20
![Page 21: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/21.jpg)
Complement of a Graph
21
![Page 22: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/22.jpg)
Isomorphic Graphs
22
![Page 23: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/23.jpg)
Isomorphic Graphs
Which of the following function define a graph isomorphism for the graphs shown below?
OX
23
![Page 24: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/24.jpg)
Isomorphic Graphs
24
![Page 25: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/25.jpg)
Isomorphic Graphs
Are the following two graphs isomorphic?
In (a), a and d each adjacent to two other vertices.In (b), u, x, and z each adjacent to two other vertices.
X
25
![Page 26: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/26.jpg)
Vertex Degree
26
![Page 27: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/27.jpg)
Theorem 11.2
27
![Page 28: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/28.jpg)
Corollary 11.1
28
![Page 29: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/29.jpg)
29
![Page 30: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/30.jpg)
a
b
c
d
30
![Page 31: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/31.jpg)
Euler Circuit and Euler Trail
31
![Page 32: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/32.jpg)
Theorem 11.3
(⇒) 1.2.3.4.5.6.
7.32
![Page 33: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/33.jpg)
Theorem 11.3
8.
9.
33
![Page 34: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/34.jpg)
Theorem 11.3
(⇐) 1.2.3.
34
![Page 35: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/35.jpg)
Theorem 11.3
4.
5.6.
7.8.
35
![Page 36: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/36.jpg)
Theorem 11.3
9.10.11.12.
13.
14.36
![Page 37: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/37.jpg)
Corollary 11.2
(⇐) 1.
2.3.4.(⇒) The proof of only if part is similar to that of
Theorem 11.3 and omitted.
37
![Page 38: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/38.jpg)
Incoming and Outgoing Degrees
2
38
![Page 39: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/39.jpg)
Theorem 11.4
The proof is similar to that of Theorem 11.3 and omitted.
39
![Page 40: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/40.jpg)
Planar Graph
Which of the following is a planar graph?
O O40
![Page 41: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/41.jpg)
Euler’s Theorem
v =e =r =v – e + r = 2
783
41
![Page 42: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/42.jpg)
Euler’s Theorem• Proof. 1. Use induction on v (number of vertices).• 2. Basis (v = 1):
– G is a “bouquet” of loops, each a closed curve in the embedding.
– If e = 0, then r = 1, and the formula holds.– Each added loop passes through a region and cuts
it into 2 regions. This augments the edge count and the region count each by 1. Thus the formula holds when v = 1 for any number of edges.
42
![Page 43: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/43.jpg)
Euler’s Theorem• 3. Induction step (v>1):
– There exists an edge e that is not a loop
because G is connected.– Obtain a graph G’ with v’ vertices, e’ edges, and r’
regions by contracting e.– Clearly, v’=v–1, e’=e–1, and r’=r.– v’– e’+ r’ = 2. – Therefore, v-e+r=2.
e
(induction hypothesis)
43
![Page 44: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/44.jpg)
Corollary 11.3
1. It suffices to consider connected graphs; otherwise, we could add edges.
2. If v 3, every region contains at least three edges (L(Ri) 3r).
3. 2e=L(Ri), implying 2e3r.
4. By Euler’s Theorem, v–e+r=2, implying e≤ 3v– 6.
If also G is triangle-free, then e ≤ 2v–4.
(L(Ri) 4r)
(2e4r)
(e≤ 2v–4)
If G is a simple planar graph with at least three vertices, then e≤3v–6. (A simple graph is not a multigraph and does not contain any loop.)
44
![Page 45: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/45.jpg)
Bipartite Graph
45
![Page 46: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/46.jpg)
Nonplanarity of K5 and K3,3
K5 (e = 10, n = 5) K3,3 (e = 9, n = 6)
• These graphs have too many edges to be planar. – For K5, we have e = 10>9 = 3n-6.
– Since K3,3 is triangle-free, we have e = 9>8 = 2n-4.
46
![Page 47: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/47.jpg)
Subdivision of a Graph
47
![Page 48: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/48.jpg)
Subdivision of a Graph
48
![Page 49: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/49.jpg)
49
![Page 50: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/50.jpg)
50
![Page 51: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/51.jpg)
Hamilton Cycle
51
![Page 52: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/52.jpg)
Hamilton Cycle
Does the following graph contain a hamiltion cycle? X
52
![Page 53: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/53.jpg)
Theorem 11.8
1.2.
3.4.
53
![Page 54: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/54.jpg)
Theorem 11.8
5.6.
7.8.9.10.11.12.
13.54
![Page 55: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/55.jpg)
Theorem 11.814.15.
16.
17.18.
19.
55
![Page 56: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/56.jpg)
Theorem 11.8
17.18.
19.
20.
56
![Page 57: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/57.jpg)
Theorem 11.9
1.2.
3.
4.5.
57
![Page 58: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/58.jpg)
Theorem 11.9
6.
7.
8.9.
10.
11.58
![Page 59: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/59.jpg)
Proper Coloring and Chromatic Number
59
![Page 60: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/60.jpg)
Counting Proper Colors
1.
2.
3.4.
60
![Page 61: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/61.jpg)
61
![Page 62: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/62.jpg)
Theorem 11.10
1.2.3.4.5.6.
62
![Page 63: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/63.jpg)
Example 11.36
63
![Page 64: Chap. 11 Graph Theory and Applications](https://reader033.fdocuments.us/reader033/viewer/2022061604/56815ab9550346895dc87682/html5/thumbnails/64.jpg)
Example 11.37
64