Graphs and Networks (AQA A-Level Further Maths): Flashcards

Vertices (points) connected by edges (lines)

Same connection pattern, different visual appearance

No loops and no multiple edges

Complete graph with $n$ vertices

2 vertex sets; edges only join vertices from different sets

2 (connects vertex to itself at both ends)

Sum of all degrees $= 2 imes$ number of edges

Can be drawn with no edges crossing except at vertices

$V + F - E = 2$

$AB + BC geq AC$