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 is the degree sequence of the graph with vertices of degrees 3, 2, and 1?
List the degrees in non-increasing order.
Is the sequence (4, 3, 2, 1) a graphic sequence?
Try to visualize a graph.
Which of the following conditions must a sequence meet to be considered graphic?
Recall the relationship between edges and vertex degrees.
True or False: Every non-negative sequence is a graphic sequence.
Consider the necessary conditions we've discussed.
Given a sequence (6, 5, 4, 3, 2, 1), prove whether this is a graphic sequence using the Havel-Hakimi theorem.
Calculate the sum to verify.
Construct a simple graph from the degree sequence (2, 2, 2, 2).
Ensure each vertex connects with exactly two others.
5 more questions in this section. Enroll free to practise them all.
Enroll free