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.
Define degree sequence.
Think about what degree refers to in graphs.
What must be true about the degrees in a graphic sequence?
Consider if negative degrees make sense in graph theory.
What defines a graphic sequence?
Think about the properties of graph representation.
True or False: The sum of the degrees in a graphic sequence can be odd.
Reflect on how edges are connected to vertices.
Prove that the sequence (3, 3, 3, 1) is graphic, using systematic reduction.
Take steps to verify each reduction.
Design a sequence of your own that is non-graphic and explain why it fails the graphic tests.
Check the sum of your proposed sequence.
4 more questions in this section. Enroll free to practise them all.
Enroll free