# Chapter 14 - Graph Theory - Chapter Summary, Review, and Test - Review Exercises - Page 935: 5

The paths E,C,A and E,D,B,A are two paths which start at vertex E and end at vertex A.

#### Work Step by Step

If there is at least one edge connecting two vertices in a graph, the vertices are adjacent to each other. A path is a sequence of adjacent vertices. Let's start at vertex E. The path can travel to vertex C and then to vertex A. This path is E,C,A. This path starts at vertex E and ends at vertex A. Let's start at vertex E. The path can travel to vertex D, then to vertex B, and then to vertex A. This path is E,D,B,A. This path starts at vertex E and ends at vertex A. The paths E,C,A and E,D,B,A are two paths which start at vertex E and end at vertex A. There are also other paths in the graph which start at vertex E and end at vertex A.

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.