28.1. Discrete Mathematics

Try these first

1. 1.

   What is a vertex cut?

   Hint

   Think about what it means for a graph to become disconnected.

2. 2.

   Define edge connectivity.

   Hint

   Consider edges that, when removed, would separate parts of the graph.

3. 3.

   What is the definition of a vertex cut?

   Hint

   Think about how removing certain points affects the overall structure.

4. 4.

   True or False: Edge connectivity and vertex connectivity are the same.

   • True
   • False

   Hint

   Consider what vertices and edges represent in a graph context.

5. 5.

   Consider a graph with 6 vertices where every vertex is connected to every other vertex. What would be its vertex connectivity?

   Hint

   Think about how many vertices you can remove from a complete graph.

6. 6.

   Analyze a graph drawn in a circular fashion, and determine how removing certain edges (two specific edges) affect connectivity.

   Hint

   Assess how edges connect different parts of the circular shape.