Practice Edge Set Cardinality (4.3.2) - Prof. Ashish Choudhury - Discrete Mathematics - Vol 3

Practice: Edge Set Cardinality

Lesson 4.3.2Prof. Ashish Choudhury

Practise this section

8 questions

Flashcard drill
2 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is vertex connectivity?
Show hintHide hint
Think about how many vertices you need to take away.
Question 2.
Define edge connectivity.
Show hintHide hint
Consider the edges connecting the vertices.
3Question 3.
What is the relationship between vertex connectivity, edge connectivity, and minimum degree?
- Vertex ≤ Edge ≤ Minimum Degree
- Edge ≤ Vertex ≤ Minimum Degree
- Minimum Degree ≤ Vertex ≤ Edge
Show hintHide hint
Think about how removing elements affects connectedness.
4Question 4.
True or False: Edge connectivity is always greater than vertex connectivity.
- True
- False
Show hintHide hint
Recall the definitions of both terms.
Question 5.
Given a graph with a total vertex count of 10 and a missing edge set resulting from removing vertices, derive the edge set cardinality.
Show hintHide hint
Use the relationships of vertex degrees before and after deletion.
Question 6.
Create a graph where vertex connectivity equals edge connectivity but is less than minimum degree, and explain your reasoning.
Show hintHide hint
Ensure your selections lead to edges and vertices that satisfy all three conditions.

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