离散数学课件6.4 connectivtity.pptVIP

Section 6.4 Connectivity连通性 Path Definition 1. A path 路径of length n from u to v, where n is a positive integer, in an undirected graph is a sequence of edges e1,e2,…,en of the graph such that f(e1)={x0,x1}, f(e2)={x1,x2},…, f(en)={xn-1,xn},where x0=u, x1=v. When the graph is simple简图, we denote this path by its vertex sequence x0,x1 x2,…,xn(since listing the vertices uniquely determines the path).The path is a circuit回路 if it begins and ends at the same vertex, that is u=v. The path or circuit is said to pass through or traverse途经 the vertices x1,x2,…,xn-1.A path is simple if it does not contain the same edge more than once. Note: There is nothing to prevent traversing an edge back and forth to produce arbitrarily long paths. This is usually not interesting which is why we define a simple path简单路径. Examples: Let G1 be the following graph: There are many paths from u1 to u3 in G1: 1) u1, u4, u2, u3; length = 3, the path is simple u1 u2 u5 u4 u3 2) u1, u5, u4, u1, u2, u3; length = 5, the path is simple and it contains a circuit u1, u5, u4, u1. 3) u1, u2, u5, u4, u3; length = 4, the path is simple Definition 2. A path of length n from u to v, where n is a positive integer, from u to v in an directed multigraph is a sequence of edges e1,e2,…,en of the graph such that f(e1)=(x0,x1), f(e2)=(x1,x2),…, f(en)=(xn-1,xn),where x0=u, xn=v. When there are no multiple edges in the graph, this path is denoted by its vertex sequence x0,x1 x2,…,xn.The path is a circuit or cycle if it begins and ends at the same vertex, that is u=v. A path is simple if it does not contain the same edge more than once. P333:EXAMPLE 2,3,4(bacon number) Connectedness in undirected graphs Definition: A undirected graph is connected连通的 if there is a path between every pair of distinct vertices of the graph. ________________ Example The graph G is connected,since for every pair of distinct vertices there is a path between them. The graph H is not connected. For