Practice Case 2: Vertex V Is Not Adjacent (5.4.2.2) - Lecture - 54 - Discrete Mathematics

Practise this section

9 questions

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

6 sample questions

Question 1.
Determine if the sequence (3, 2, 2) is graphic.
Show hintHide hint
Check if the sum is even.
Question 2.
Is the sequence (0, 0, 0) graphic?
Show hintHide hint
Consider the nature of disconnected vertices.
3Question 3.
What must the sum of a graphic sequence be?
- Odd
- Even
- Prime
Show hintHide hint
Consider how edges are counted in a graph.
4Question 4.
The Havel-Hakimi theorem is used to verify if a sequence is graphic. True or False?
- True
- False
Show hintHide hint
Think of the iterative method employed.
Question 5.
Given the sequence (8, 5, 5, 4, 4, 3, 2), assess if it's graphic and explain your reasoning.
Show hintHide hint
Use the Havel-Hakimi method step by step.
Question 6.
Analyze the sequence (10, 3, 3, 2, 1) and determine if it can exist as a graphic sequence.
Show hintHide hint
Look for contradictions when applying the theorem.

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