No |
Topic |
Difficulty |
Syllabus |
Level |
1 |
Graph theory\Adjacency and network matrices/Adjaceny and network matrices |
Easy |
A-level |
D1 |
2 |
Graph theory\Spanning trees\Minimum spanning tree\Prims algorithm |
Intermediate |
A-Level |
D1 |
3 |
Graph theory\Spanning trees\Minimum spanning tree\Kruskals algorithm |
Intermediate |
A-Level |
D1 |
4 |
Graph theory\Degree\degree sequence |
Easy |
A-Level |
D1 |
5 |
Graph theory/Adjaceny and network matrices/Number of walks |
Hard |
Undergraduate |
Foundation |
6 |
Graph theory/Adjaceny and network matrices/Number of walks |
Intermediate |
Undergraduate |
Foundation |
7 |
Graph theory/Simple and connected graphs |
Easy |
A-Level |
D1 |
8 |
Graph theory\Spanning trees\Minimum spanning tree\Kruskals algorithm |
Intermediate |
A-level |
D1 |
9 |
Graph theory\Degree\indegree\outdegree |
Intermediate |
A-level |
D1 |
10 |
Graph theory\Degree\degree sequence |
Hard |
A-level |
D1 |
11 |
Graph theory\Degree\degree sequence |
Hard |
A-level |
D1 |
12 |
Graph theory\Spanning trees\Minimum spanning tree\Prims algorithm |
Hard |
A-Level |
D1 |
|