Foundation to VCE • Explore the maths library • Try a free sample
VCE Specialist Mathematics Units 1–2 · Algebra, number and structure

Graph theory and structural proofs

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.

3 printable resources11 pages12 questionsWorked answers
A$3.90Planned launch price · including GST
One household or one teacher’s own classes
Preview available. Checkout opens soon.The full topic collection is prepared. Explore a sample before choosing.

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?

  1. 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

ResourceLengthPracticeAnswers
Learn and practise4 pages4 questionsIncluded
Apply and extend4 pages4 questionsIncluded
Topic checkpoint3 pages4 questionsIncluded

Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.