AQA A-level Further Mathematics 7367 · DA6

Simple graphs, simple-connected graphs and trees

Code: DA6
In: 3.5.1 DA: Graphs
Topic: 3.5 Optional application 3 – discrete mathematics
Course: A-level Further Mathematics 7367
Board: AQA

Codes and titles are read by a script from AQA's published specification and have not been checked by a person. What each point covers is in the specification itself: AQA’s specification.

Points in 3.5.1 DA: Graphs

DA1 Language of graphs
DA2 Eulerian, semi-Eulerian and Hamiltonian graphs
DA3 Euler’s formula for planar graphs
DA4 Kuratowski’s theorem and planarity
DA5 Complete and bipartite graphs, adjacency matrices and complements
DA6 Simple graphs, simple-connected graphs and trees
DA7 Isomorphic graphs