Question 1.61

31.

  1. In the accompanying graph, find the largest number of paths from A to C that do not have any edges in common.
    image
  2. Verify that the largest number of paths with no edges in common between any pair of vertices in this graph is the same.
  3. Why might we want to be able to design graphs such that we can move between two vertices of a graph using paths that have no edges in common?

31.

(a) 3

(b) Answers will vary.

(c) Answers will vary.