Practice Discrete Mathematics (4.1) - Prof. Ashish Choudhury - Discrete Mathematics

Practise this section

5 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
3 questions · about 2 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.
Define vertex connectivity.
Show hintHide hint
Think about what happens to a graph when you remove certain nodes.
Question 2.
Illustrate a scenario where edge connectivity equals minimum degree.
Show hintHide hint
Consider simple cycles or complete graphs.
3Question 3.
What is vertex connectivity?
Show hintHide hint
Think about the vertices needed to maintain a graph's structure.
4Question 4.
True or False: Edge connectivity is always less than or equal to minimum degree.
Show hintHide hint
Consider definitions of connectivity and minimum degree.
Question 5.
Given a graph with known vertex and edge count, derive the minimum degree.
Show hintHide hint
Use the relationships between vertex and edge connectivity.
Question 6.
Construct a graph with vertex and edge connectivity conditions and explain your reasoning.
Show hintHide hint
Think about how you can increase connectivity by adding edges strategically.

1 more question in this section. Enroll free to practise them all.