24.1.2. Types of Graphs

Try these first

1. 1.

   Define a directed graph.

   Hint

   Think about the direction of relationships between points.

2. 2.

   What is the degree of a vertex?

   Hint

   Count how many connections a vertex has.

3. 3.

   What is the main distinction between directed and undirected graphs?

   • Directed graphs have direction; undirected graphs do not
   • They are the same
   • Only directed graphs can contain cycles

   Hint

   Think about how you would walk along the edges.

4. 4.

   True or False: A simple graph can have self-loops.

   • True
   • False

   Hint

   Remember the principles of simple graphs.

5. 5.

   You have a bipartite graph with 10 vertices, divided into two sets of 5 vertices each. How many possible edges exist?

   Hint

   Count how pairs of nodes can connect between the sets.

6. 6.

   Construct a simple graph with 6 vertices and 9 edges. Can you draw it and explain your reasoning?

   Hint

   Explore how vertices can connect without repeating edges.