1.2.

2 Knowledge Check: Graph Theory

For the following digraph:

B C

E
D

1. What are the vertices? ______________________________________

2. What are the arcs? ____________________________________________________

3. Answer the following questions yes or no.

i). Is it possible to get from A to D in one step? __________
ii). Is it possible to get from A to D? __________
iii). Is it possible to get from E to D? __________

iv). Is it possible to get from D to B? __________

v). Is there a four step loop passing through all of A, B, C, and E? __________
1.2.2 Knowledge Check: Graph Theory
Answer Key

1. (Answer: A, B, C, D, E)
Explanation: The vertices are represented by circles or ellipses.

2. (Answer: (A, B), (A, C), (A, E), (B, C), (B, D), (C, A), (C, E), (E, C) )

Explanation: The first letter in the ordered pair is the name of the node where the tail of
the arrow originates. The second letter is where the arrow points. There are eight arrows
so there should be 8 ordered pairs.

3.
i). (Answer: no)
Explanation: There is no arrow from A to D.

ii). (Answer: yes)

Explanation: Go from A to B and then from B to D.

iii).(Answer: yes)
Explanation: Go from E to C, then from C to A, then from A to B, and then from B to
D.

iv). (Answer: no)

Explanation: The arrow goes from B to D, not vice versa.

v). (Answer: no)

Explanation: There is only one arrow into A. So any loop must go from C to A.
From A it is possible to go from A to B or A to E. However, from B we cant get
directly to E; and from E we cant get directly to B.

Notice that the path, C -> A -> B -> C -> E -> C, is possible, but it isnt an answer to
the question asked.