Graph terminology, adjacency matrices, Euler's formula, Eulerian and Hamiltonian graphs and trails

What this note covers

1. Describe vertices, edges and degrees
2. Build and read an adjacency matrix
3. Apply Euler’s formula to planar graphs
4. Decide whether an Euler trail exists
5. Identify Hamiltonian paths and cycles
6. Audit graph terminology and routes

6 sections · 10 key terms & formulas · 6 common mistakes