What you’ll work on
- Graph theory
Start with the idea
The handshaking lemma counts every undirected edge at both ends: the sum of degrees is 2 E. A loop contributes 2 to its vertex degree.
A simple connected planar graph satisfies V−E+F=2. Trees are connected and contain no cycles; complete and bipartite graphs have additional counting properties.
A worked example
How many edges does the complete graph K6 have?
- Choose an unordered pair of distinct vertices: 6×5/2.
Answer: 15.
Try one question
Find the number of edges in a 3-regular graph on 8 vertices.
Show answer and explanation
12.
Degree sum 24 is twice the edge count.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.