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.
2 cards from this section. Quick, good the night before a test.
What is the degree of vertex A if it connects to three edges?
Count each connecting edge.
True or False: A self-loop adds one to the degree of a vertex.
Recall how we define self-loops.
What is the degree of a vertex?
Think about the count of edges incident to the vertex.
True or False: The Handshaking Theorem concludes that the number of odd-degree vertices is even.
Recall the theorem and its implications.
Given a graph with 7 vertices and 10 edges, what can you infer about the total degree and the number of odd-degree vertices?
Use the Handshaking theorem to deduce the conclusion.
Create an undirected graph with 3 odd-degree vertices and explain why this is not possible.
Consider how odd numbers add together.
4 more questions in this section. Enroll free to practise them all.
Enroll free