Loading the lesson
Loading the lesson
Search AllRounder.ai
Search the courses, subjects, tracks, games and features, or jump straight to a page.
Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What is a degree sequence?
Think about how you order numbers.
Can a degree sequence contain negative numbers?
Consider what a negative degree would imply.
What is a graphic sequence?
Consider the definitions we just discussed.
True or False: The sum of degrees in a graphic sequence can be odd.
Remember the connection between edges and vertex degrees.
Prove that the sequence (4, 3, 2, 2, 1) is graphic using the Havel-Hakimi theorem.
Use the steps of reduction methodically.
Construct a graphic sequence for a simple triangle and a simple square.
Consider the number of vertices and edges in each shape.
5 more questions in this section. Enroll free to practise them all.
Enroll free