Vertex
A is adjacent only to vertex C (since there is no edge from A to B or D).
Vertex B is adjacent only to vertex C (since there is no edge from B to A or D).
Vertex C is adjacent to vertices A, B, and D (since there is an edge connecting C to A, B,
and D).
Vertex D is adjacent to C (since there is an edge connecting D to C) and to itself (since
there is a loop connecting C to itself).
The degree of vertex
A is 1 (since there is exactly 1 edge going into A).
The degree of vertex B is 1 (since there is exactly 1 edge going into B).
The degree of vertex C is 3 (since there are exactly 3 edge going into C).
The degree of vertex D is 3 (remember, a loop adds 2 to the degree).
The degree of vertex E is 0 (since there are no edges going into E).
.
Vertex E is called an isolated vertex (since there are no edges going into it).
The highlighted edges form path AFED.
