Practice Upper Bounds On Vertex Connectivity And Edge Connectivity (28.1.6)

Practise this section

11 questions

Flashcard drill
5 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
5 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a vertex cut in a graph?
Show hintHide hint
Think of how removing certain points affects connections.
Question 2.
What is the range of vertex connectivity for any graph?
Show hintHide hint
Connectivity relates to the ability to disconnect the graph.
3Question 3.
What is the vertex connectivity of a complete graph?
- 0
- 1
- n-1
Show hintHide hint
Think about how many points you can remove while still keeping the graph connected.
4Question 4.
True or False: Every disconnected graph has a vertex connectivity of 0.
- True
- False
Show hintHide hint
Consider the definition: Is it already disconnected?
Question 5.
Design a specific graph with 5 vertices and determine both its vertex and edge connectivity. Detail your process.
Show hintHide hint
Consider simple configurations first.
Question 6.
Give a real-world analogy for vertex and edge connectivity along with a scenario illustrating their importance.
Show hintHide hint
Think about how cities rely on roads and intersections.

7 more questions in this section. Enroll free to practise them all.