Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What does the term 'degree sequence' refer to in graph theory?
Think about what degree means for a vertex.
True or False: A vertex can have a negative degree.
Consider what a degree represents.
What is the degree sequence of a graph?
Consider how you list the degrees.
True or False: All sequences that contain non-negative integers can be graphic.
Reflect on examples that couldn't satisfy graphical conditions.
Construct a graphic sequence of your own with five vertices and explain why it is graphic.
Think about the connections you can make that meet the degree needs.
Apply the Havel-Hakimi theorem to the sequence (8, 6, 6, 4, 2, 1). Show all steps to verify its graphic nature.
Follow the reduction process diligently and ensure you count correctly.
5 more questions in this section. Enroll free to practise them all.
Enroll free