Graph types and Eulerian graphs

Graph types and Eulerian graphs Quiz

Spec 1.3 · Edexcel A-Level Further Maths: Quiz

Studying this course? Keep your progress in one place.

Pick an answer for each. Quizzes never use energy.

5 questions, one answer each

Each answer is checked as you go, with why.

See all 5 questions

1. A connected graph has vertex degrees $4,4,2,2,2$ . Which description is correct?
- A. Eulerian
- B. Semi-Eulerian
- C. Neither
- D. A tree
2. How many edges does $K_7$ have?
- A. $14$
- B. $42$
- C. $28$
- D. $21$
3. A graph has degrees $3,3,3,3,2$ . What is it?
- A. Eulerian
- B. Neither Eulerian nor semi-Eulerian
- C. Semi-Eulerian
- D. This graph cannot exist
4. A tree has 9 vertices. How many edges does it have?
- A. $9$
- B. $10$
- C. $7$
- D. $8$
5. Two graphs both have 5 vertices and degrees $3,3,2,2,2$ . What can you conclude?
- A. They might be isomorphic, but this is not proved yet
- B. They are isomorphic
- C. They are not isomorphic
- D. Both are Eulerian