Euler's formula for planar graphsAQA A-Level Further Maths: Flashcards
Card 1 of 130 of 13 known
Question
State Euler's formula for a connected planar graph.
Tap or press Space to reveal
Tap card or press Space to flip
See all 13 cards
- State Euler's formula for a connected planar graph.
- What does include in Euler's formula?
- All faces, including the outer (unbounded) face.
- What is a planar graph?
- A graph that can be drawn in the plane with no edges crossing.
- A connected planar graph has , . Find .
- How many faces does a tree have?
- One, the outer face; for a tree .
- Effect on of adding a new vertex joined by one edge?
- None; and both increase by .
- Effect on of adding an edge between two existing vertices (no crossings)?
- increases by .
- Effect on of subdividing an edge?
- None; one vertex and one edge are added.
- What is the sum of the face degrees?
- , because each edge borders two faces (or the same face twice).
- If every face has degree , which equation links and ?
- Why does a simple planar graph have ?
- Every face has at least edges, as there are no loops or multiple edges.
- Rearrange Euler's formula for .
- Why must the graph be connected?
- Euler's formula applies to connected graphs; disconnected graphs have a different constant.
Exam questions on Euler's formula for planar graphs
- A connected planar graph has vertices and edges.Every face of , including the outer face, is bounded by the same number of edges. Find this number.2 marks
- A connected simple planar graph has vertices, and every face, including the outer face, is bounded by exactly edges.Find the number of faces, and state how many of them are bounded faces, not counting the outer face.2 marks
- A connected planar graph has vertices, and its edges divide the plane into faces, including the outer face.Find the number of edges.3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).