15.6: Exercises
Recognizing paths and trails.
In each of Exercises 1–4, you are given a walk through a graph. Determine whether the walk is a path, a trail, or neither. Also determine whether the walk is open or closed.
\(v_1, e_1, v_2, e_2, v_3, e_3, v_4, e_{12}, v_6, e_6, v_3 \text{.}\)
\(v_1, e_1, v_2, e_2, v_3, e_3, v_4, e_4, v_5, e_5, v_6, e_6, v_3, e_7, v_7, e_8, v_1 \text{.}\)
\(v_1, e_8, v_7, e_7, v_3, e_7, v_7, e_8, v_1 \text{.}\)
\(v_3, e_3, v_4, e_4, v_5, e_5, v_6, e_6, v_3 \text{.}\)
Consider the graph in Figure \(\PageIndex{1}\).
- Determine four different paths from vertex \(1\) to vertex \(5\text{.}\)
- Determine four different trails from vertex \(1\) to vertex \(5\text{,}\) none of which are paths.
- Determine four different walks from vertex \(1\) to vertex \(5\text{,}\) none of which are trails.
Consider the graph in Figure \(\PageIndex{2}\).
- How many different trails are there from vertex \(1\) to vertex \(5\text{?}\)
- How many different paths are there from vertex \(1\) to vertex \(5\text{?}\) (Hint: See Proposition 15.2.1 .)
- How many different walks are there from vertex \(1\) to vertex \(5\text{?}\)
Recognizing bridges.
In each of Exercises 7–10, identify each edge that is a bridge.
The complete graph with \(n\) vertices.
Among all possible nonconnected graphs with \(n\) vertices, let \(H\) be one with the maximum number of edges. Prove that \(H\) has exactly two connected components.
- Hint.
-
Argue by contradiction.
Suppose \(G\) is a connected graph that contains a closed path that is also a trail. Prove that it is possible to remove any single edge from this path and be left with a connected subgraph of \(G\text{.}\) That is, prove that no edge in this path could be a bridge.
Prove that a graph in which every edge is a bridge cannot have a closed path that is also a trail.