Networks & Matrices (Edexcel A-Level Further Mathematics): Flashcards

Graph where edges represent connections; may have weights (distances, costs, capacities)

Represent vertices

$a_{ij} = 1$

$a_{ij} = 0$

Weight of edge between $i$ and $j$

$a_{ij} = infty$

$a_{ij} = a_{ji}$

No self-loop at that vertex

Non-zero entries

$infty$