← All topics
Quiz: Graph Theory: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. A graph has 10 edges. What is the sum of the degrees of all its vertices?
- Q2. A connected graph has an Euler circuit if and only if:
- Q3. How many edges does a tree with 25 vertices have?
- Q4. Which graph is NOT bipartite?
- Q5. Why is K5 not planar?
- Q6. How many edges does the complete graph K₆ have?
- Q7. What does this print? (code)
- Q8. By Cayley's formula, how many spanning trees does K₄ have?
- Q9. A connected planar graph has 6 vertices and 9 edges. How many faces does any plane drawing of it have (including the outer face)?
- Q10. What is the chromatic number of a cycle with 5 vertices (C₅)?