Graph Theory离散数学、图论、双语课件.pptVIP

Ch1-* Homework Exercise 1.6:1, 2, 3, 4, 5, 8, 9 采井亢耗科碎冕若惰柜剧矽湛卖酋肩馈瞅夫垦衙隐色胃殿选巾涌嗜弗忻衔Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* Outline 1.1 What is a graph? 1.2 The Degree of a Vertex 1.3 Isomorphic Graphs 1.4 Subgraphs 1.5 Degree Sequences 1.6 Connected Graphs 1.7 Cut-Vertices and Bridges 1.8 Special graphs 1.9 Digraphs 厨就晴私句剥娱碱频伍本镭磋搁世涛悄遭渭逝丛哨絮留茨秘取凌拈撅砒嗓Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* 1.7 Cut Vertices and Bridges Definition 1 A vertex v in a graph G is called a cut-vertex if k(G - v) k(G). So v is a cut-vertex in a connected graph G if G - v is disconnected. 耙老亿埠泼市隧系伎始勋又寨俘疹殉载腔鸣毕嫉狈绝斥之牡毫铬娠柒俩芥Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* e.g. G : cut-vertex： 　　　　　　　　　　　　 v3, v5 cut-edge： v5v6 v1 v5 v3 v2 v4 v6 潘签秆兔话棕齿浮参半价照库奢苛驳踊条烬盟喇摘咀小仍腮苍瘤扭萄萤佐Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* Definition 2 An edge e in a graph G is called a bridge (cut-edge) if k(G - e) k(G). e.g. The graph in previous page:  v5v6 is a bridge. Note. (1) if v is a cut-vertex of a connected graph G, then k(G - v) ? 2 (2)If e is a bridge of a connected graph G, then k(G - e) =2 搓挽站拴罢刊祟疙盂梆态道央炯稽凭丁自癣辰矣昭都广阳珊伯庚善汁漳肖Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* Proof. (?) Let e be a bridge of G. Suppose e =uv, and assume, to the contrary, that e lies on a cycle C：u, v, w, …, x, u. 　Then C - e：v, w, …, x, u is a u-v path of G - e. Claim: G - e is connected. (If the claim is true, ??) Theorem 1.4 An edge e of a connected graph G is a bridge iff e does not lie on a cycle of G. (e is not a bridge) 专总眼烛配植奋氛七屡浇梗息帐铲鞠亡抹贾拥澡塘叮小钙苹郧酸邀禹艘匈Graph Theory离散数学、图论、双语课件Graph Theory离散数学、图论、双语课件 Ch1-* (Proof of above Claim) Let u1, v1 ? V(G-e)=V(G) ∵G is connected ∴?? u1-v1 path P in G. If e ? P, then P is