Year 10 Mathematics

Networks: planar graphs, Euler's formula and Eulerian trails

Two worked questions, each with its solution and marking guidelines.

  • Questions at easy and medium levels
  • As short answer and multiple choice
  • New numbers every time, from 5,000+ templates across NSW Years 7 to 12

Two worked examples

Question 12 marksMedium

A connected network has 88 vertices of odd degree and all its other vertices have even degree. What is the smallest number of separate trails that together travel along every edge exactly once?

Worked solution

Each trail starts at one odd vertex and ends at another odd vertex, so it uses up two odd vertices

Number of trails =82=4= \dfrac{8}{2} = 4

=4= 4

Answer

44

Marking guidelines

States that each trail uses up two odd vertices

1 mark

Divides to find the number of trails

1 mark

Report a problem with this question.

Question 23 marksMedium

A connected planar graph has 88 vertices and the sum of the degrees of its vertices is 2020. How many faces does it have, including the outside face?

Worked solution

The sum of the degrees is twice the number of edges: E=202=10E = \dfrac{20}{2} = 10

Euler's formula V−E+F=2V - E + F = 2 gives F=2−8+10F = 2 - 8 + 10

F=4F = 4

Answer

44

Marking guidelines

Uses the sum of the degrees to find the number of edges

1 mark

Writes Euler's formula with the values

1 mark

Solves for the number of faces

1 mark

Report a problem with this question.

Not affiliated with NESA.