What you’ll work on
- Graphs and networks
Start with the idea
Graphs represent objects as vertices and connections as edges. A path does not repeat vertices; a trail does not repeat edges.
For a connected planar graph, V−E+F=2, counting the outside face. A spanning tree connects all vertices without cycles and has V−1 edges.
A worked example
A connected planar graph has 6 vertices and 8 edges. Find faces.
- 6−8+F=2, so F=4.
Answer: 4.
Try one question
An undirected graph has edges AB, AC, BC, CD. List vertex degrees.
Show answer and explanation
A 2, B 2, C 3, D 1.
Count incident edges at each vertex.
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.