Skip to main content
-
-
15.1: Motivation
-
Driving routes on a graph. Looking at a map of Alberta, you might decide that there are three reasonable driving routes from Camrose to Red Deer and three reasonable driving routes from Red Deer to Drumheller.
-
-
15.2: Walks, trails, and paths
-
Suppose G=(V,E) is a graph.
-
-
15.3: Connected Vertices, Graphs, and Components
-
Connected Vertices: a pair of vertices v,v′ such that there exists a walk beginning at v and ending at v′
-
-
15.4: Articulation vertices, bridges, and edge connectivity
-
Articulation Vertex: a vertex of a graph such that, if it were to be removed (along with any edges incident to it), the resulting subgraph would have more connected components than the original
-
-
15.5: Activities
-
-
-
15.6: Exercises
-