Further Mathematics 7367: Graphs Topical Past Paper Questions
AQA A Level Further Mathematics (7367) past-paper questions on Graphs, free. This topic is frequently examined across 6 exam sessions. Sign in for the full topic-segregated question bank and AI worksheets.
Sample questions
The simple-connected graph G has the adjacency matrix Which one of the following statements about G is true? Tick (✓) one box. [1 mark] G is a tree G is complete G is Eulerian G is planar
The graph G is shown below. (a) (i) State, with a reason, whether or not G is simple. [2 marks] (a) (ii) A student states that G is Eulerian. Explain why the student is correct. [2 marks] (b) The graph $ H $ has 8 vertices with degrees 2, 2, 4, 4, 4, 4, 4 and 4 Comment on whether…
Graph A is a connected planar graph with 12 vertices, 18 edges and n faces. Find the value of n Circle your answer. [1 mark] 4 8 28 32
Sign in required
Full Graphs question set, mark schemes and AI worksheets
Log in for the full topic-segregated question set, mark schemes, and AI worksheets built from every Further Mathematics past paper. New accounts start with 25 free credits.
Explore all Further Mathematics topics
All Further Mathematics topics