4.2.2. Graph Construction Details

Try these first

1. 1.

   What is vertex connectivity?

   Hint

   Think about how many vertices you can remove to make the graph disconnected.

2. 2.

   Define edge connectivity.

   Hint

   Consider what happens to the graph when you remove edges.

3. 3.

   What is vertex connectivity?

   Hint

   Minimum vertices to disconnect a graph.

4. 4.

   True or False: Edge connectivity is always greater than or equal to vertex connectivity.

   • True
   • False

   Hint

   No hint provided

5. 5.

   Create a graph with vertex connectivity = 5, edge connectivity = 4, and minimum degree = 6. Describe the method you used.

   Hint

   Use stronger interconnections to manage reach across vertices.

6. 6.

   Evaluate and adjust a constructed graph to achieve vertex connectivity = edge connectivity while maintaining the minimum degree.

   Hint

   Manage edges effectively to secure both connections.