Mathematics A, Further H235: Graphs and Networks Topical Past Paper Questions
OCR AS Mathematics A, Further (H235) past-paper questions on Graphs and Networks, free. This topic is regularly examined across 4 exam sessions. Sign in for the full topic-segregated question bank and AI worksheets.
Sample questions
There are six non-isomorphic trees with exactly six vertices. A student has drawn the diagram below showing six trees each with exactly six vertices. However, two of the trees that the student has drawn are isomorphic. A B CC DD E $ F $ (a) Identify which two of these trees are i…
Graph G is a simply connected Eulerian graph with 4 vertices. (a) (i) Explain why graph G cannot be a complete graph. [2] (ii) Determine the number of arcs in graph G, explaining your reasoning. [2] (iii) Show that graph G is a bipartite graph. [1] Graph H is a digraph with 4 ver…
The complete bipartite graph $ K_{3,4} $ connects the vertices $ \{2,4,6\} $ to the vertices $ \{1,3,5,7\} $. (i) How many arcs does the graph $ K_{3,4} $ have? [Unlabeled] (ii) Deduce how many different paths are there that pass through each of the vertices once and once only. T…
Sign in required
Full Graphs and Networks question set, mark schemes and AI worksheets
Log in for the full topic-segregated question set, mark schemes, and AI worksheets built from every Mathematics A, Further past paper. New accounts start with 25 free credits.
Explore all Mathematics A, Further topics
All Mathematics A, Further topics