Graph Properties / Features

Fun Class Activity:

  1. Consider the following digraph $D$:
    1. List all the edges whose initial vertex is $v_1$.
    2. List all the edges whose terminal vertex is $v_1$.
    3. What is the in-degree and out-degree of $v_1$?
    4. List two different paths from $v_1$ to $v_4$.
    5. Does $D$ have:
      1. A cycle?
      2. A loop?
      3. Parallel edges?
    6. Is $v_1$ reachable from $v_4$? Explain.
An exercise digraph.

The digraph $D$. Miriam Briskman, CC BY-NC 4.0.

These notes by Miriam Briskman are licensed under CC BY-NC 4.0 and based on sources.