Practice Proof Of The Havel-hakimi Theorem (5.4) - Lecture - 54 - Discrete Mathematics

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 a degree sequence?
Show hintHide hint
Think about how you would list the degrees of the vertices.
Question 2.
Is the sequence (3, 2, 1) graphic? Why?
Show hintHide hint
Try to visualize the connections between the vertices.
3Question 3.
Is the sequence (1, 1, 1) graphic?
- True
- False
Show hintHide hint
Remember to visualize the connections!
4Question 4.
What does the Havel-Hakimi theorem help you determine?
- If a graph is connected
- If a degree sequence is graphic
- The number of edges in a graph
Show hintHide hint
Think about the theorem's purpose!
Question 5.
Create a degree sequence of your choice that is graphic and explain why using Havel-Hakimi.
Show hintHide hint
Start with the highest degree!
Question 6.
Formulate a non-graphic sequence and demonstrate using Havel-Hakimi that it cannot be represented.
Show hintHide hint
Note the importance of each decrement.

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