The document defines several graph terminology terms including adjacent vertices, which are vertices connected by an edge. It also defines predecessor and successor vertices for directed graphs, degree of a vertex as the number of edges incident to it, and in-degree and out-degree for directed graphs. As an example, it calculates the in-degrees, out-degrees, and degrees of the vertices in a sample directed graph.