Download
1 / 16
160 likes | 218 Views
9.4 Connectivity. Path Informally, a path is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph.
E N D
9.4 Connectivity Path • Informally, a path is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph. • Definition 1: Let n be a nonnegative integer and G an undirected graph. A path of length n from u to v in G is a sequence of edges e1, e2,. . ., enof G such that e1 is associated with {x0, x1}, e2is associated with {x1, x2}, and so on, with enassociated with [xn-1, xn} where x0 =u and xn=v. when the graph is simple we dente this path by its vertex sequence x0, x1,. . .,xn(because listing these vertices uniquely determines the path). The path is a circuit if it begins and ends at the same vertex, that is , if u=v , and has length greater than zero. The path or circuit is said to pass through the vertices x0, x1,. . .,xn-1or traverse the edges e1, e2,. . ., en. A path or circuit is simple if it does not contain the same edge more than once.
Path • Example 1: in the simple graph shown in figure 1, a, d, c, f, e is a simple path of length 4, because {a , d}, {d, c} , {c, f}, and {f, e} are all edges. However, d, e, c, a is not a path, because {e, c} is not an edge note that b, c, f, e, b is a circuit of length 4 because {b, c}, {c, f} ,{f, e}, and {e, b} are edges, and this path begins and this path begins and ends at b. The path a, b, e, d, a, b. which is of length 5, is not simple because it contains the edge {a, b} twice. FIGURE 1 A Simple Graph.
Path • Definition 2: Let n be a nonnegative integer and G a directed graph. A path of length n from u to v in G is a sequence of edges e1, e2,. . ., enof G such that e1 is associated with (x0, x1), e2is associated with (x1, x2), and so on, with enassociated with (xn-1, xn) where x0 =u and xn=v. when there are no multiple edges in the directed graph, this path is denoted by its vertex sequence x0, x1,. . .,xn . A path of length greater than zero that begins and ends at the same vertex is called a circuit or cycle . A path or circuit is called simple if it does not contain the same edge more than once.
Path • Example 2: Paths in Acquaintanceship Graphs In an acquaintanceship graph there is a path between two people if there is a chain of people linking these people, where two people adjacent in the chain know one another. For example, in Figure 7 in Section 9.1, there is a chain of six people linking Kamini and Ching. Many social scientists have conjectured that almost every pair of people in the world are linked by a small chain of people, perhaps containing just five or fewer people. • This would mean that almost every pair of vertices in the acquaintanceship graph containing all people in the world is linked by path of length not exceeding four. • The play Six Degrees of Separation by John Guare is based on this notion.
Connectedness In Undirected Graphs • Definition 3: An undirected graph is called connected if there is a path between every pair of distinct vertices of the graph. • Example 5: The graph G1in Figure 2 is connected, because for every pair of distinct vertices there is a path between them (the reader should verify this). However, the graph G2 in Figure 2 is not connected. For instance, there is no path in G2 between vertices a and d.
Connectedness In Undirected Graphs FIGURE 2 The Graphs G1 and G2.
Connectedness In Undirected Graphs • Theorem 1: There is a simple path between every pair of distinct vertices of a connected undirected graph.
Connectedness In Undirected Graphs • Example 6: What are the connected components of the graph H shown in Figure 3? FIGURE 3 The Graph H and Its Connected Components H1, H2, and H3.
Connectedness In Undirected Graphs • Example 8: Find the cut vertices and cut edges in the graph G shown in below. FIGURE 4 The Graph G.
Connectedness In Directed Graphs • Definition 4: A directed graph is strongly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph. • Definition 5: A directed graph is weakly connected if there is a path between every two vertices in the underlying undirected graph.
Connectedness In Directed Graphs • Example 9: Are the directed graphs G and H shown in below strongly connected ? Are they weakly connected ? FIGURE 5 The Directed Graphs G and H.
Connectedness In Directed Graphs • Example 10: The graph H in Figure 5 has three strongly connected components , consisting of the vertex a; the vertex e; and the graph consisting of the vertices b, c, and d and edges (b, c), (c, d), and (d, b).
Paths and Isomorphism • Example 12: Determine whether the graphs G and H shown in Figure 6 isomorphic. FIGURE 6 The Graphs G and H.
Paths and Isomorphism • Example 13: Determine whether the graphs G and H shown in Figure 7 are isomorphic. FIGURE 7 The Graphs G and H.
Counting Paths Between Vertices • Theorem 2: Let G be a graph with adjacency matrix A with respect to the ordering v1 , v2 , . . .,vn, (with directed or undirected edges, with multiple edges and loops allowed). • The number of different paths of length r from vi to vj, where r is a positive integer , equals the (i , j)th entry of Ar .
Counting Paths Between Vertices • Example 15: How many paths of length four are there from a to d in the simple graph G in Figure 8? FIGURE 8 The Graphs G and H.
